Sciweavers

1538 search results - page 80 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
15 years 6 months ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
CVPR
2006
IEEE
16 years 3 months ago
Unsupervised Learning of Categories from Sets of Partially Matching Image Features
We present a method to automatically learn object categories from unlabeled images. Each image is represented by an unordered set of local features, and all sets are embedded into...
Kristen Grauman, Trevor Darrell
EUROPAR
2007
Springer
15 years 7 months ago
Towards Real-Time Compression of Hyperspectral Images Using Virtex-II FPGAs
Abstract. Hyperspectral imagery is a new type of high-dimensional image data which is now used in many Earth-based and planetary exploration applications. Many efforts have been d...
Antonio Plaza
ICASSP
2011
IEEE
14 years 5 months ago
Efficient transform coding of two-channel audio signals by means of complex-valued stereo prediction
Traditional MDCT-based perceptual audio coding schemes employ mid/side and intensity stereo techniques to allow efficient joint coding of the two channels of a stereophonic signal...
Christian R. Helmrich, Pontus Carlsson, Sascha Dis...
ICML
2009
IEEE
16 years 2 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang