Sciweavers

101 search results - page 10 / 21
» Optimal Random Matchings on Trees and Applications
Sort
View
CVPR
2007
IEEE
16 years 6 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
ICALP
2009
Springer
16 years 4 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 11 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
GRAPHICSINTERFACE
1997
15 years 5 months ago
A Heuristic Method for Generating 2D CSG Trees from Bitmaps
This paper presents a method for generating compact and effective constructive-solid-geometry (CSG) object representations from 2D bitmap representations. The method consists of t...
Sarah F. Frisken Gibson, Joe Marks, Danielle Feinb...
JSAC
2011
116views more  JSAC 2011»
14 years 11 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao