Sciweavers

1994 search results - page 353 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
STACS
2005
Springer
15 years 3 months ago
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
Abraham Flaxman, Bartosz Przydatek
WCRE
2002
IEEE
15 years 2 months ago
Estimating Potential Parallelism for Platform Retargeting
Scientific, symbolic, and multimedia applications present diverse computing workloads with different types of inherent parallelism. Tomorrow’s processors will employ varying com...
Linda M. Wills, Tarek M. Taha, Lewis B. Baumstark ...
SIGMOD
1999
ACM
143views Database» more  SIGMOD 1999»
15 years 2 months ago
WALRUS: A Similarity Retrieval Algorithm for Image Databases
Traditional approaches for content-based image querying typically compute a single signature for each image based on color histograms, texture, wavelet transforms etc., and return...
Apostol Natsev, Rajeev Rastogi, Kyuseok Shim
IPPS
1998
IEEE
15 years 2 months ago
An Architecture for Network Resource Monitoring in a Distributed Environment
As part of its HiPer-D Program, the United States Navy is developing an experimental distributed system which achieves survivability by dynamically reconfiguring the system using ...
Philip M. Irey IV, Robert W. Hott, David T. Marlow
ECOOPW
1994
Springer
15 years 1 months ago
Abstracting Interactions Based on Message Sets
ing Interactions Based on Message Sets Svend Frr 1 and Gul Agha2. 1 Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94303 2 University of Illinois, 1304 W. Springf...
Svend Frølund, Gul Agha