Sciweavers

2638 search results - page 58 / 528
» Random Geometric Complexes
Sort
View
JMLR
2010
101views more  JMLR 2010»
14 years 9 months ago
Classification Using Geometric Level Sets
A variational level set method is developed for the supervised classification problem. Nonlinear classifier decision boundaries are obtained by minimizing an energy functional tha...
Kush R. Varshney, Alan S. Willsky
133
Voted
ICCV
2003
IEEE
16 years 4 months ago
Geometric Segmentation of Perspective Images Based on Symmetry Groups
Symmetry is an effective geometric cue to facilitate conventional segmentation techniques on images of man-made environment. Based on three fundamental principles that summarize t...
Allen Y. Yang, Shankar Rao, Kun Huang, Wei Hong, Y...
COMPGEOM
2006
ACM
15 years 8 months ago
Online geometric reconstruction
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
Bernard Chazelle, C. Seshadhri
116
Voted
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
15 years 6 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson
GECCO
2007
Springer
262views Optimization» more  GECCO 2007»
15 years 8 months ago
Geometric particle swarm optimization for the sudoku puzzle
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
Alberto Moraglio, Julian Togelius