Sciweavers

3906 search results - page 718 / 782
» From grids to places
Sort
View
STOC
2007
ACM
105views Algorithms» more  STOC 2007»
14 years 10 months ago
Balanced allocations: the weighted case
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...
Kunal Talwar, Udi Wieder
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 10 months ago
The PCP theorem by gap amplification
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...
Irit Dinur
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 10 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
VLDB
2001
ACM
127views Database» more  VLDB 2001»
14 years 10 months ago
Efficiently publishing relational data as XML documents
: XML is rapidly emerging as a standard for exchanging business data on the World Wide Web. For the foreseeable future, however, most business data will continue to be stored in re...
Jayavel Shanmugasundaram, Eugene J. Shekita, Rimon...
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
14 years 10 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...