Sciweavers

483 search results - page 78 / 97
» On perfectness of sums of graphs
Sort
View
HOTOS
1993
IEEE
14 years 23 days ago
Object Groups May Be Better Than Pages
I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or ...
Mark Day
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 10 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
CGF
2008
150views more  CGF 2008»
13 years 8 months ago
Compact, Fast and Robust Grids for Ray Tracing
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...
Ares Lagae, Philip Dutré
GIS
2002
ACM
13 years 8 months ago
Mapping Dilution of Precision (MDOP) and map-matched GPS
A novel method of map matching using the Global Positioning System (GPS) has been developed which uses digital mapping and height data to augment point position computation. This m...
Geoffrey Blewitt, George E. Taylor
ATAL
2011
Springer
12 years 8 months ago
Incentive design for adaptive agents
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....