Sciweavers

2096 search results - page 259 / 420
» Structured Parameter Elicitation
Sort
View
SIBGRAPI
2008
IEEE
15 years 11 months ago
Tradeoffs in Approximate Range Searching Made Simpler
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
156
Voted
ECAI
2004
Springer
15 years 10 months ago
Emergence of Complex Networks through Local Optimization
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
Josep M. Pujol, Andreas Flache, Ramon Sangües...
CVPR
2003
IEEE
15 years 10 months ago
A Perspective on Distortions
A framework for analyzing distortions in non-single viewpoint imaging systems is presented. Such systems possess loci of viewpoints called caustics. In general, perspective (or un...
Rahul Swaminathan, Michael D. Grossberg, Shree K. ...
182
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
VLDB
2001
ACM
66views Database» more  VLDB 2001»
15 years 9 months ago
An Evaluation of Generic Bulk Loading Techniques
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
Jochen Van den Bercken, Bernhard Seeger