1328 search results - page 174 / 266 » An Optimization Algorithm for the Ordered Open-End Bin-Packi... |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
COMPGEOM
2003
ACM
14 years 2 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
AAAI
2006
13 years 10 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
WDAG
2000
Springer
14 years 14 days ago
2000
Springer
Weconsider the problemof generic broadcast in asynchronous systems with crashes, a problem that was rst studied in 12]. Roughly speaking, given a \con ict" relation on the set...