3946 search results - page 640 / 790 » The computational complexity of choice sets |
165
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
194
click to vote
STOC
2005
ACM
16 years 2 days ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
185
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
The Matching Pursuits (MP) coding method has been employed successfully in video coding. In it, the motion compensated frame difference is decomposed on an overcomplete dictionary...
170
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
152
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...