Sciweavers

2168 search results - page 110 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
SAT
2004
Springer
117views Hardware» more  SAT 2004»
15 years 8 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher
CRYPTO
1994
Springer
104views Cryptology» more  CRYPTO 1994»
15 years 7 months ago
Cryptographic Randomness from Air Turbulence in Disk Drives
Abstract. A computer disk drive's motor speed varies slightly but irregularly, principally because of air turbulence inside the disk's enclosure. The unpredictability of ...
Don Davis, Ross Ihaka, Philip Fenstermacher
AAAI
2007
15 years 5 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck
ECCV
1996
Springer
16 years 5 months ago
Learning Dynamics of Complex Motions from Image Sequences
In Proc. European Conf. Computer Vision, 1996, pp. 357{368, Cambridge, UK The performance of Active Contours in tracking is highly dependent on the availability of an appropriate ...
David Reynard, Andrew Wildenberg, Andrew Blake, Jo...
123
Voted
TSMC
2002
110views more  TSMC 2002»
15 years 2 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek