465 search results - page 59 / 93 » On the Hardness of Range Assignment Problems |
177
click to vote
GIS
2009
ACM
16 years 29 days ago
2009
ACM
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
179
click to vote
PODS
2009
ACM
16 years 13 days ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
117
click to vote
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
As a promising new technology with the unique properties like high efficiency, scalability and fault tolerance, Peer-toPeer (P2P) technology is used as the underlying network to b...
119
click to vote
STOC
2006
ACM
16 years 6 days ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
ECRTS
2003
IEEE
15 years 5 months ago
2003
IEEE
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...