7930 search results - page 1231 / 1586 » Greedy in Approximation Algorithms |
173
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
170
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
177
click to vote
WIS
2004
15 years 8 months ago
2004
The sensor networks, web click stream and astronomical applications generate a continuous flow of data streams. Most likely data streams are generated in a wireless environment. Th...
207
click to vote
NIPS
2003
15 years 8 months ago
2003
In order to understand AdaBoost’s dynamics, especially its ability to maximize margins, we derive an associated simplified nonlinear iterated map and analyze its behavior in lo...
177
click to vote
VMV
2003
15 years 8 months ago
2003
The visual hull is an efficient shape approximation for the purpose of reconstructing and visualizing dynamic objects. Recently, rapid progress in graphics hardware development h...