Sciweavers

3229 search results - page 444 / 646
» Mixing
Sort
View
CAV
2007
Springer
116views Hardware» more  CAV 2007»
16 years 6 days ago
A Decision Procedure for Bit-Vectors and Arrays
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
Vijay Ganesh, David L. Dill
CCS
2007
ACM
16 years 6 days ago
A k-anonymous communication protocol for overlay networks
Anonymity is increasingly important for network applications concerning about censorship and privacy. The existing anonymous communication protocols generally stem from mixnet and...
Pan Wang, Peng Ning, Douglas S. Reeves
159
Voted
CIVR
2007
Springer
149views Image Analysis» more  CIVR 2007»
16 years 5 days ago
Video copy detection: a comparative study
This paper presents a comparative study of methods for video copy detection. Different state-of-the-art techniques, using various kinds of descriptors and voting functions, are d...
Julien Law-To, Li Chen, Alexis Joly, Ivan Laptev, ...
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
16 years 5 days ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
CP
2007
Springer
16 years 5 days ago
Constructive Interval Disjunction
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
Gilles Trombettoni, Gilles Chabert