Sciweavers

2638 search results - page 473 / 528
» Random Geometric Complexes
Sort
View
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 8 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
CI
2004
116views more  CI 2004»
13 years 8 months ago
Solution Generation with Qualitative Models of Preferences
We consider automated decision aids that help users select the best solution from a large set of options. For such tools to successfully accomplish their task, eliciting and repre...
Boi Faltings, Marc Torrens, Pearl Pu
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 8 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
CVIU
2004
143views more  CVIU 2004»
13 years 8 months ago
Shape matching of partially occluded curves invariant under projective transformation
This paper describes a method to identify partially occluded shapes which are randomly oriented in 3D space. The goal is to match the object contour present in an image with an ob...
Carlos Orrite, José Elías Herrero Ja...
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 8 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber