Sciweavers

5595 search results - page 1072 / 1119
» Comparing Subsumption Optimizations
Sort
View
PPOPP
1997
ACM
14 years 21 days ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
14 years 21 days ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
SPAA
1993
ACM
14 years 17 days ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
ACCV
2009
Springer
14 years 16 days ago
People Tracking and Segmentation Using Efficient Shape Sequences Matching
Abstract. We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, po...
Junqiu Wang, Yasushi Yagi, Yasushi Makihara
ACMICEC
2007
ACM
201views ECommerce» more  ACMICEC 2007»
14 years 16 days ago
Bid based scheduler with backfilling for a multiprocessor system
We consider a virtual computing environment that provides computational resources on demand to users with multiattribute task descriptions that include a valuation, resource (CPU)...
Inbal Yahav, Louiqa Raschid, Henrique Andrade
« Prev « First page 1072 / 1119 Last » Next »