Sciweavers

4482 search results - page 822 / 897
» The Crowdsourcing Design Space
Sort
View
114
Voted
CADE
2007
Springer
16 years 27 days ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
103
Voted
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 27 days ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
164
Voted
SIGMOD
2009
ACM
122views Database» more  SIGMOD 2009»
16 years 24 days ago
Finding min-repros in database software
Testing and debugging database system applications is often challenging and time consuming. A database tester (or DB tester for short) has to detect a problem, determine why it ha...
Nicolas Bruno, Rimma V. Nehme
193
Voted
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 24 days ago
Asynchronous view maintenance for VLSD databases
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
Parag Agrawal, Adam Silberstein, Brian F. Cooper, ...
186
Voted
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
16 years 24 days ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng