Sciweavers

227 search results - page 21 / 46
» A Competitive Algorithm for the General 2-Server Problem
Sort
View
JDA
2006
77views more  JDA 2006»
13 years 8 months ago
On Multi-threaded Metrical Task Systems
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...
Esteban Feuerstein, Steven S. Seiden, Alejandro St...
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 8 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
IPMI
2011
Springer
12 years 12 months ago
Nonnegative Factorization of Diffusion Tensor Images and Its Applications
This paper proposes a novel method for computing linear basis images from tensor-valued image data. As a generalization of the nonnegative matrix factorization, the proposed method...
Yuchen Xie, Jeffrey Ho, Baba C. Vemuri
SAT
2004
Springer
115views Hardware» more  SAT 2004»
14 years 1 months ago
Full CNF Encoding: The Counting Constraints Case
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
Olivier Bailleux, Yacine Boufkhad
SIGECOM
2004
ACM
165views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Adaptive limited-supply online auctions
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...