Sciweavers

1274 search results - page 247 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
13 years 11 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
FOCS
1991
IEEE
13 years 11 months ago
A General Approach to Removing Degeneracies
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
Ioannis Z. Emiris, John F. Canny
CLEF
2010
Springer
13 years 8 months ago
The Robot Vision Track at ImageCLEF 2010
This paper describes the robot vision track that has been proposed to the ImageCLEF 2010 participants. The track addressed the problem of visual place classification, with a specia...
Andrzej Pronobis, Marco Fornoni, Henrik I. Christe...
BMCBI
2006
96views more  BMCBI 2006»
13 years 7 months ago
Structure alignment based on coding of local geometric measures
Background: A structure alignment method based on a local geometric property is presented and its performance is tested in pairwise and multiple structure alignments. In this appr...
Peter L. Chang, Andrew W. Rinne, T. Gregory Dewey
FGCS
2006
74views more  FGCS 2006»
13 years 7 months ago
A performance model of non-deterministic particle transport on large-scale systems
In this work we present a predictive analytical model that encompasses the performance and scaling characteristics of a nondeterministic particle transport application, MCNP (Mont...
Mark M. Mathis, Darren J. Kerbyson, Adolfy Hoisie