Sciweavers

19866 search results - page 3910 / 3974
» Computing all factorizations in ***
Sort
View
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 9 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
IPL
2006
110views more  IPL 2006»
14 years 9 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
CORR
2007
Springer
122views Education» more  CORR 2007»
14 years 9 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar
CPHYSICS
2007
106views more  CPHYSICS 2007»
14 years 9 months ago
The way towards thermonuclear fusion simulators
In parallel to the ITER project itself, many initiatives address complementary technological issues relevant to a fusion reactor, as well as many remaining scientific issues. One...
A. Bécoulet, Per Strand, H. Wilson, M. Roma...
89
Voted
IVC
2006
227views more  IVC 2006»
14 years 9 months ago
Automatic registration of overlapping 3D point clouds using closest points
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
Yonghuai Liu
« Prev « First page 3910 / 3974 Last » Next »