Sciweavers

365 search results - page 29 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
DCOSS
2008
Springer
13 years 10 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
IPPS
2006
IEEE
14 years 2 months ago
Exploiting processing locality through paging configurations in multitasked reconfigurable systems
FPGA chips in reconfigurable computer systems are used as malleable coprocessors where components of a hardware library of functions can be configured as needed. As the number of ...
T. Taher, Tarek A. El-Ghazawi
AMEC
2004
Springer
14 years 1 months ago
Revenue Failures and Collusion in Combinatorial Auctions and Exchanges with VCG Payments
Abstract. In a combinatorial auction, there are multiple items for sale, and bidders are allowed to place a bid on a bundle of these items rather than just on the individual items....
Vincent Conitzer, Tuomas Sandholm
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
14 years 1 months ago
Route skyline queries: A multi-preference path planning approach
— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects bein...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...
ICPR
2006
IEEE
14 years 9 months ago
Detecting Rotational Symmetry Under Affine Projection
A new method is presented for detecting planar rotational symmetry under affine projection. The method can deal with partial occlusion and is able to detect multiple rotationally ...
Gareth Loy, Hugo Cornelius