Sciweavers

490 search results - page 92 / 98
» Impossibilities for roommate problems
Sort
View
FOCS
1992
IEEE
14 years 24 days ago
Fault-tolerant Wait-free Shared Objects
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...
Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg
CICLING
2010
Springer
14 years 22 days ago
Word Length n-Grams for Text Re-use Detection
Abstract. The automatic detection of shared content in written documents –which includes text reuse and its unacknowledged commitment, plagiarism– has become an important probl...
Alberto Barrón-Cedeño, Chiara Basile...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
14 years 18 days ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
FOCS
2000
IEEE
14 years 9 days ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
AIPS
2008
13 years 11 months ago
Generative Planning for Hybrid Systems Based on Flow Tubes
When controlling an autonomous system, it is inefficient or sometimes impossible for the human operator to specify detailed commands. Instead, the field of AI autonomy has develop...
Hui X. Li, Brian C. Williams