2949 search results - page 367 / 590 » Universal Sparse Modeling |
93
Voted
ICALP
2009
Springer
15 years 7 months ago
2009
Springer
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
94
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
123
Voted
SAT
2009
Springer
15 years 7 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
115
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
139
click to vote
SMA
2009
ACM
15 years 7 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...