Sciweavers

1395 search results - page 211 / 279
» Modeling betweenness for question answering
Sort
View
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 6 months ago
An Ad Omnia Approach to Defining and Achieving Private Data Analysis
We briefly survey several privacy compromises in published datasets, some historical and some on paper. An inspection of these suggests that the problem lies with the nature of the...
Cynthia Dwork
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 6 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
SIGMOD
2004
ACM
204views Database» more  SIGMOD 2004»
16 years 6 months ago
Buffering Database Operations for Enhanced Instruction Cache Performance
As more and more query processing work can be done in main memory, memory access is becoming a significant cost component of database operations. Recent database research has show...
Jingren Zhou, Kenneth A. Ross
MOBISYS
2004
ACM
16 years 5 months ago
Tracking Moving Devices with the Cricket Location System
We study the problem of tracking a moving device under two indoor location architectures: an active mobile architecture and a passive mobile architecture. In the former, the infra...
Adam Smith, Hari Balakrishnan, Michel Goraczko, Ni...
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
16 years 26 days ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret