78 search results - page 1 / 16 » How to Quickly Find a Witness |
CINQ
2004
Springer
14 years 12 days ago
2004
Springer
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
ICFP
2009
ACM
14 years 1 months ago
2009
ACM
We address the problem of testing and debugging concurrent, distributed Erlang applications. In concurrent programs, race conditions are a common class of bugs and are very hard t...
ATAL
2006
Springer
13 years 10 months ago
2006
Springer
Current computational trust models are usually built either on an agent's direct experience of an interaction partner (interaction trust) or reports provided by third parties...
ICDE
2011
IEEE
12 years 10 months ago
2011
IEEE
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...