Sciweavers

31 search results - page 1 / 7
» Sorting under partial information (without the ellipsoid alg...
Sort
View
STOC
2010
ACM
153views Algorithms» more  STOC 2010»
13 years 10 months ago
Sorting under partial information (without the ellipsoid algorithm)
Jean Cardinal, Samuel Fiorini, Gwenaël Joret,...
IWMMDBMS
1996
64views more  IWMMDBMS 1996»
13 years 6 months ago
Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
Renato Pajarola, Peter Widmayer
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 5 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
SPAA
2003
ACM
13 years 10 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
CISS
2008
IEEE
13 years 11 months ago
Partial side information problem: Equivalence of two inner bounds
— Consider the two-terminal partial side information problem, where one source is decoded under a distortion measure, while the other acts as a helper. There are two well known i...
Soumya Jana, Richard E. Blahut