Sciweavers

93 search results - page 18 / 19
» Conditional hardness for approximate coloring
Sort
View
COMPGEOM
2010
ACM
13 years 10 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
CIVR
2010
Springer
427views Image Analysis» more  CIVR 2010»
13 years 9 months ago
An efficient method for face retrieval from large video datasets
The human face is one of the most important objects in videos since it provides rich information for spotting certain people of interest, such as government leaders in news video,...
Thao Ngoc Nguyen, Thanh Duc Ngo, Duy-Dinh Le, Shin...
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 7 months ago
Context-dependent predictions and cognitive arm control with XCSF
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...
Martin V. Butz, Oliver Herbort
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 5 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
12 years 8 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown