Sciweavers

206 search results - page 34 / 42
» A nonblocking set optimized for querying the minimum value
Sort
View
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
14 years 2 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
COR
2006
94views more  COR 2006»
13 years 8 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm
GEOINFORMATICA
1998
79views more  GEOINFORMATICA 1998»
13 years 7 months ago
Symbolic Intersect Detection: A Method for Improving Spatial Intersect Joins
Due to the increasing popularity of spatial databases, researchers have focused their efforts on improving the query processing performance of the most expensive spatial database ...
Yun-Wu Huang, Matthew C. Jones, Elke A. Rundenstei...
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 9 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei