Sciweavers

6601 search results - page 741 / 1321
» Optimal Distributed Arc-Consistency
Sort
View
PODC
2005
ACM
16 years 24 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
IPPS
1997
IEEE
15 years 11 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
ECCC
2011
282views ECommerce» more  ECCC 2011»
15 years 1 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
ICDE
1996
IEEE
178views Database» more  ICDE 1996»
16 years 8 months ago
Query Folding
Query folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previou...
Xiaolei Qian
ICPR
2008
IEEE
16 years 8 months ago
Segmentation by combining parametric optical flow with a color model
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
Adrian Ulges, Thomas M. Breuel