David Eppstein - Factbites

David Eppstein - Factbites
Where results make sense
About us | Why use us? | Reviews | PR | Contact us

Topic: David Eppstein

Note: these results are not from the primary (high quality) database.

In the News (Tue 22 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	ActiveState O'Reilly Python cookbook code samples ratings review
		Maximum cardinality matching in general graphs (David Eppstein)
		Convex hull and diameter of 2d point sets (David Eppstein)
		Uses a recursively called simple generator (with the same arguments as the outer call!) to traverse...
	aspn.activestate.com /ASPN/Cookbook/Python?author=218935 (355 words)

	acute.tri
		-- David Eppstein UC Irvine Dept. of Information & Computer Science eppstein@ics.uci.edu http://www.ics.uci.edu/~eppstein/ ============================================================================== From: eppstein@wormwood.ICS.UCI.EDU (David Eppstein) Subject: nice geometry puzzle Newsgroups: sci.math Date: 28 Oct 96 17:45:20 GMT Here's an even better solution to the problem of triangulating a square with all angles at most 72.
		Place as guides two congruent regular pentagons, meeting at a face, diagonally in the square (as large as possible, so that four of their corners touch the square's sides).
		Any better would require avoiding degree-five vertices inside the square, which seems to be difficult.
	www.math.niu.edu /~rusin/known-math/96/acute.tri (945 words)

	Solution
		David Eppstein (Geometry Junkyard) suggested combining these problems.
		Many thanks to Adrian Fisher, Branko Grunbaum, Michael Hirschhorn, Bernie Cosell, William I Johnson, Douglas Heller, Juha Saukkola, Eric Swab, Chris Dueker, Rick Rubenstein, Kiran Kedlaya, Peter Beck, Roger Phillips, Bill Pegg, John Bailey, Scot Rhoads, Ken Sample, Rick Rubenstein, Darren Rigby, and David Eppstein for suggestions, ideas, and commentary.
		David shows that three arcs are enough for the 4x4 case.
	www.mathpuzzle.com /Solution.htm (9635 words)

	Soddy Circles and David Eppstein's Centers
		Eppstein derives his result as a particular case of a 3D configuration of four spheres.
		By symmetry, the same is true of the outer Eppstein point.
		Indeed, among other things, Eppstein proves the following
	www.cut-the-knot.org /Curriculum/Geometry/Eppstein.shtml (739 words)

	ASPN
		Re: ANN: Python Imaging Library 1.1.3 (march 15, 2002) (David Eppstein)
		Your search for Eppstein produced the following results, presented by content type/location.
		The bars to the left of the results indicate the relevancy of the results to your search term.
	aspn.activestate.com /ASPN/search?query=Eppstein&x=0&y=0&... (176 words)

	David Eppstein - Publications
		Journals -- Publications -- David Eppstein -- Theory Group -- Inf.
		Chrobak, D. Eppstein, G.F. Italiano, and M. Yung.
		Described slightly superlinear algorithms for partitioning a tree into a given number of subtrees, making them all as short as possible.
	www.cecs.uci.edu /~eppstein/pubs/j-no.html (2302 words)

	Re: comments re draft version 2.0
		Stan Devitt ----- Original Message ----- From: David Eppstein <eppstein@ics.uci.edu> To: Sent: Monday, April 10, 2000 9:28 PM Subject: Re: comments re draft version 2.0 > Stan Devitt writes: > > O(x) could be written.
		The move to discussion of algorithm bounds earlier in computing courses would drive such a need.
		I thought the > purpose of content style over presentation style was to preserve useful > semantic information?
	lists.w3.org /Archives/Public/www-math/msg00697.html (375 words)

	Gene Macintosh Genealogy Software
		Gene is a shareware genealogy database for the Macintosh written by David and Diana Eppstein.
		You can use Gene to store family data and notes, draw and print family trees and pedigree charts, create web pages from your database, and exchange GEDCOM data with users of other genealogy programs.
	www.ics.uci.edu /~eppstein/gene (264 words)

	David Eppstein
		Eppsteins on the net if you think you've reached the wrong me.
		My name is not uncommon (although the spelling is atypical); see my page of
	www.ics.uci.edu /~eppstein (84 words)

	Marshall Bern, Erik Demaine, David Eppstein, and Barry Hayes: A Disk-Packing Algorithm for an Origami Magic Trick
		Marshall Bern, Erik Demaine, David Eppstein, and Barry Hayes, ``A Disk-Packing Algorithm for an Origami Magic Trick,'' in Proceedings of the 3rd International Meeting of Origami Science, Math, and Education (OSME 2001), Monterey, California, March 9-11, 2001, pages 17-28.
		Marshall Bern, Erik Demaine, David Eppstein, and Barry Hayes: A Disk-Packing Algorithm for an Origami Magic Trick
		We present an algorithm for a magic trick.
	theory.lcs.mit.edu /~edemaine/papers/OSME2001b (146 words)

	BIPM -- Bipartite Matching Codes
		David Eppstein's WWW page http://www.ics.uci.edu/~eppstein/161/kmp/ contains an implementation of the Knuth-Morris-Pratt string matching algorithm in C++.
		The program works in any dimension, but doesn't do Minkowski sums of more complicated shapes.
		This page last modified on Feb 17, 1997.
	www.cs.sunysb.edu /~algorith/implement/eppstein/implement.shtml (110 words)

	David Eppstein
		Eppstein, School of Information and Computer Science, UC Irvine
		Using sparsification for parametric minimum spanning tree problems
	fano.ics.uci.edu /cites/Author/David-Eppstein.html (611 words)

	David Eppstein at MSRI - Searching for spaceships
		David Eppstein at MSRI - Searching for spaceships
	www.msri.org /publications/ln/msri/2000/gametheory/eppstein/1 (8 words)

	Mathematics and Recreational Mathematics
		Public Web files for David Eppstein {a lot of Maths/Recreational Math links/texts and any more!}
		David SINGMASTER's Web page (by David Singmaster, Mario Velucchi)
	kam.mff.cuni.cz /~babilon/mirror/vel-math.htm (8 words)

	DBLP: David Hart
		David Eppstein, David Hart: An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments.
		Peng Wang, George Turner, Daniel A. Lauer, Matthew Allen, Stephen Simms, David Hart, Mary Papakhian, Craig A. Stewart: LINPACK Performance on a Geographically Distributed Linux Cluster.
		Craig A. Stewart, David Hart, Donald K. Berry, Gary J. Olsen, Eric A. Wernert, William Fischer: Parallel implementation and performance of fastDNAml: a program for maximum likelihood phylogenetic inference.
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/h/Hart:David.html (413 words)

	Eppstein Relatives and Namesakes
		Anthony David Eppstein , my father, is a photographer, web designer, and retired disk drive engineer.
		David G. Epstein <david@dgelaw.com> is a construction failure lawyer, not the same as the Piper Aircraft lawyer (!), has a Columbia Univ. Ph.D. and works in Irvine (!!!).
		He has many Epstein cousins, fortunately not all also named David G. David L. Epstein is a media and research assistant at Rutgers U. David L. Epstein, M.D. is a professor of opthalmology at Duke U.
	www.ics.uci.edu /~eppstein/eppstein.html (2961 words)

	Don&Helen.ged
		0 HEAD 1 SOUR Gene 2 VERS 4.3 2 CORP David & Diana Eppstein 1 DEST 1 DATE 1 MAR 2002 1 SUBM @U1@ 1 FILE Don&Helen.ged 1 GEDC 2 VERS 5.5 2 FORM LINEAGE-LINKED 1 CHAR ANSEL 0 @U1@ SUBM 1 NAME 1 ADDR 2 CONT 2 PHON 0 @I1@ INDI 1 NAME ?
		52a): 1 m 16-26 (Joseph), 1 f 16-26 (Rebecca?) On 2 CONT same page, a couple of lines below David Morrison and Robert Young; 2 CONT not same page as father Nicholas, so he apparently lived in S. 2 CONT Starksboro then.
	www.uvm.edu /~dstratto/genealogy/Don&Helen.ged (1487 words)

	Computing the Discrepancy with Applications to Supersampling Patterns - Dobkin, Eppstein, Mitchell (ResearchIndex)
		@article{ dobkin96computing, author = "David P. Dobkin and David Eppstein and Don P. Mitchell", title = "Computing the discrepancy with applications to supersampling patterns", journal = "ACM Transactions on Graphics", volume = "15", number = "4", pages = "354--376", year = "1996", url = "citeseer.ist.psu.edu/dobkin96computing.html" }
		David P. Dobkin, David Eppstein, and Donald P. Mitchell
		Computing the Discrepancy with Applications to Supersampling Patterns - Dobkin, Eppstein, Mitchell (ResearchIndex)
	citeseer.ist.psu.edu /dobkin96computing.html (1487 words)

	2004 Lobby List sorted by Subject Matter
		Duncan, David P. Duncan, Michael S. Dunn, Michael Dyer, James Perry Edmondson, Eddy D. Ehlert, Paul A. Ellis, Ella M. Ellmer, Mindy R. Engelke, Tommy England, David A. Eppstein, Bryan P. Erben, Andrew C. Erben, Randall H. Erhart, Carl E. Erskine, Candis B. Erskine, John M. Jr.
		Forbes, Thomas A. Foster, Linda Fowler, Jenny Fox, Eric V. Foxhall, Irene Francisco, C. III Franke, Wayne T. Frazier, J. Kyle French, Mike Frey, James L. Friese, Janice H. Fuelberg, Curtis Fuentes, Jerry M. Galloway, Wil Garcia, David Gardner, Robert B. Jr.
		Norman, Michael Scott Jr Norris, Karen A. O'Brien, Christine Davis O'Brien, Michele P. O'Malley, Paul Oates, John David Odom, James Oliver, Harold Oneacre, Amanda Sage Osborn, O. Maurice Oswalt, Vicki R. Patterson, Steven L. Paynter, Susan Y. Pearson, David Randall Pecora, James J. Jr.
	www.ethics.state.tx.us /tedd/sublob2004c.htm (3010 words)

	CS TechReports: TR-561-96
		David P. Dobkin, David Eppstein, Don P. Mitchell, ACM TOGS vol.
		Dobkin, David P. Eppstein, David, Mitchell, Don P. Date:
		Patterns used for supersampling in graphics have been analyzed from statistical and signal-processing viewpoints.
	ncstrl.cs.princeton.edu /expand.php?id=TR-561-96 (3010 words)

	2005 Lobby List sorted by Subject Matter
		Dipprey, Ron C. Dodson, Jeffrey A. Domino, Joseph F. Douglass, Catharine Duck, Tommy Duncan, David P. Dyer, James Perry Eaton, Terri K. Ellmer, Mindy R. Embrey, Ty H. Eminger, Charles Randall Eppstein, Bryan P. Erben, Randall H. Erskine, Candis B. Erskine, John M. Jr.
		Shields, Brad II Shields, Christopher S. Shilling, Mark A. Shipton, Patricia A. Shirley, Michael G. Shivers, Marc T. Shults, John T. Sibley, David Sibley, David McAdams Jr.
		Shields, Brad II Shields, Bradford T. Shields, Christopher S. Shilling, Mark A. Shipton, Patricia A. Shivers, Marc T. Short, Jim Shults, John T. Sibley, David Sibley, David McAdams Jr.
	www.ethics.state.tx.us /tedd/sublob2005b.htm (3010 words)

	2003 Lobby List sorted by Subject Matter
		Duck, Tommy Duncan, David P. Dyer, James Perry Eaton, Terri K. Ebeid, Omniah Z. Edmondson, Eddy D. Ellmer, Mindy R. Eminger, Charles Randall Eppstein, Bryan P. Erben, Andrew C. Erben, Randall H. Erhart, Carl E. Erskine, Candis B. Erskine, John M. Jr.
		Duncan, David P. Dunn, Michael Dyer, James Perry Ebeid, Omniah Z. Ellis, Ella M. Ellmer, Mindy R. Eminger, Charles Randall Engelke, Tommy Erben, Andrew C. Erben, Randall H. Erhart, Carl E. Erskine, Candis B. Erskine, John M. Jr.
		Garrido, Jennifer Martter Garza, Elizabeth A. Garza, Rudy Gavras, John Chris II Gay, Geoffrey M. George, Jill Ann Gibbs, Gary J. Gibson, Machree Garrett Gill, David Glacken, Pamela Shawn Glover, Sue Golemon, Ronald Kinnan Gonzales, Elvia F. Goodrum, Stephanie Goodson, Adrian L. Jr.
	www.ethics.state.tx.us /tedd/lobsub2003b.htm (3010 words)

	Mathematics Archives - Numbers
		David Eppstein has collected and implemented several algorithms for constructing Egyptian fractions and includes some other notes and WWW links on the subject.
		David Eppstein has implemented a number of simple number-theoretic algorithms for his own amusement, and provide them here on the net.
		In the section on applications there are a number of interactive programs that convert rationals (or quadratic irrationals) into a simple continued fraction, as well as the converse.
	archives.math.utk.edu /subjects/numbers.html (1310 words)

	Algorithms for Computing the K Shortest Paths
		"Finding the k shortest paths" by David Eppstein : his paper and implementations of his algorithm by Shibuya, by Martins and by Graehl.
		Bibliography on K shortest paths by David Eppstein gives the references and abstracts of hundreds of publications on this subject.
		Computing the K shortest paths between two nodes in a digraph is a fundamental problem with many practical applications (that include enumeration of hypotheses in speech recognition and enumeration of sequence alignments in computational biology) and a great effort has been done in finding efficient algorithms to solve it.
	terra.act.uji.es /REA (1310 words)

	report on computational topology available
		-- David Eppstein UC Irvine Dept. of Information and Computer Science eppstein@ics.uci.edu http://www.ics.uci.edu/~eppstein/ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.cs.duke.edu/~sariel/CG/compgeom/threads.html.
		Prev by Date: CGC Workshop on Computational Geometry, 2nd call
		Incidentally, those of you on this mailing list who don't get the announcements of papers in the CoRR should probably subscribe -- see http://xxx.lanl.gov/list/cs.CG/recent for a list of recently uploaded geometry papers and http://xxx.lanl.gov/help/subscribe for instructions on how to add yourself to the mailing list.
	www.cs.duke.edu /~sariel/CG/compgeom/msg00093.html (1310 words)

	Combinatorial Game Theory
		The combinatorial game theory page of David Eppstein features an overview on combinatorial game theory and many good links.
		David's combinatorial game theory page has more good links.
		David Moews is another Berkeley Ph.D. in combinatorial game theory.
	www.cs.ualberta.ca /~mmueller/cgt (185 words)

	DBLP: David P. Dobkin
		Marshall W. Bern, David P. Dobkin, David Eppstein : Triangulating polygons without large angles.
		Marshall W. Bern, David P. Dobkin, David Eppstein : Triangulating Polygons without Large Angles.
		David P. Dobkin, David Eppstein, Don P. Mitchell : Computing the Discrepancy with Applications to Supersampling Patterns.
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/d/Dobkin:David_P=.html (185 words)

	Paul Heckbert's Collection of Mesh Generation Links
		David Eppstein's papers computational geometry & mesh generation (prof, UC Irvine)
		David Marcum mesh generation, viscous flow (prof, Mississippi State)
		These methods are mostly intended for simplification of surface meshes, but many could easily be specialized or generalized for 2-D or 3-D mesh coarsening.
	www.cs.cmu.edu /~ph/mesh.html (638 words)

	Two Player Mathematical Games - Combinatorial Games - Numericana
		Combinatorial Game Theory by David Eppstein (UC Irvine).
		Combinatorial Game Theory (including Clobber) by David Wolfe (UC Berkeley).
		For the main diagonal, the thing was proved by Howard A. Landman and Thomas S. Ferguson in July of 2000 (MSRI workshop on combinatorial games).
	home.att.net /~numericana/answer/games.htm (4673 words)

Try your search on: Qwika (all wikis)

Topic: David Eppstein

Ads by Google

Related Topics

In the News (Tue 22 Dec 09)