194 search results - page 22 / 39 » Computing Roundness is Easy if the Set is Almost Round |
IWMM
2009
Springer
14 years 2 months ago
2009
Springer
: © Garbage Collection in the Next C++ Standard Hans-J. Boehm, Mike Spertus HP Laboratories HPL-2009-360 C++, garbage collection C++ has traditionally relied on manual memory mana...
FOCS
2002
IEEE
14 years 15 days ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
CVPR
2007
IEEE
13 years 11 months ago
2007
IEEE
Interactively learning from a small sample of unlabeled examples is an enormously challenging task, one that often arises in vision applications. Relevance feedback and more recen...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...