Sciweavers

2754 search results - page 88 / 551
» Distributed Weighted Matching
Sort
View
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
13 years 10 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl
ICIAP
2009
ACM
14 years 5 months ago
Dense Two-Frame Stereo Correspondence by Self-organizing Neural Network
This work aims at defining an extension of a competitive method for matching correspondences in stereoscopic image analysis. The method we extended was proposed by Venkatesh, Y.V....
Marco Vanetti, Ignazio Gallo, Elisabetta Binaghi
PODC
2006
ACM
14 years 4 months ago
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
Bogdan Caprita, Jason Nieh, Clifford Stein
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 11 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
DAC
2006
ACM
14 years 4 months ago
Circuits for energy harvesting sensor signal processing
duce system weight and volume, increase operating lifetime, The recent explosion in capability of embedded and portable decrease maintenance costs, and open new frontiers for inele...
Rajeevan Amirtharajah, Justin Wenck, Jamie Collier...