Sciweavers

1298 search results - page 108 / 260
» The online set cover problem
Sort
View
ICPR
2010
IEEE
15 years 4 months ago
Online Next-Best-View Planning for Accuracy Optimization Using an Extended E-Criterion
Next-best-view (NBV) planning is an important aspect for three-dimensional (3D) reconstruction within controlled environments, such as a camera mounted on a robotic arm. NBV metho...
Michael Trummer, Christoph Munkelt, Joachim Denzle...
ICASSP
2011
IEEE
14 years 10 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
ENTCS
2007
115views more  ENTCS 2007»
15 years 6 months ago
A Global Algorithm for Model-Based Test Suite Generation
Abstract. Model-based testing has been proposed as a technique to automatically verify that a system conforms to its specification. A popular approach is to use a model-checker to...
Anders Hessel, Paul Pettersson
ICALP
2005
Springer
15 years 12 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
16 years 29 days ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...