Sciweavers

492 search results - page 26 / 99
» Perfect Matching Preservers
Sort
View
WEBI
2005
Springer
15 years 5 months ago
Boosting Item Keyword Search with Spreading Activation
Most keyword search engines returns directly matching keyword phrases. However, publishers cannot anticipate all possible ways in which users would search for the items in their d...
Dipti Aswath, Syed Toufeeq Ahmed, James D'cunha, H...
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 12 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
DM
2010
102views more  DM 2010»
14 years 12 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 12 months ago
Analog Matching of Colored Sources to Colored Channels
Analog (uncoded) transmission provides a simple scheme for communicating a Gaussian source over a Gaussian channel under the mean squared error (MSE) distortion measure. Unfortuna...
Yuval Kochman, Ram Zamir
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 1 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...