Sciweavers

4894 search results - page 488 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
VISUALIZATION
1997
IEEE
15 years 9 months ago
Multiresolution compression and reconstruction
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
Oliver G. Staadt, Markus H. Gross, Roger Weber
ANLP
2000
141views more  ANLP 2000»
15 years 6 months ago
Aggressive Morphology for Robust Lexical Coverage
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...
William A. Woods
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 8 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
INFOCOM
2012
IEEE
13 years 7 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
ICCV
2005
IEEE
16 years 7 months ago
Recovering Human Body Configurations Using Pairwise Constraints between Parts
The goal of this work is to recover human body configurations from static images. Without assuming a priori knowledge of scale, pose or appearance, this problem is extremely chall...
Xiaofeng Ren, Alexander C. Berg, Jitendra Malik