Sciweavers

1278 search results - page 176 / 256
» The Complexity of Weighted Boolean
Sort
View
FGR
2000
IEEE
175views Biometrics» more  FGR 2000»
14 years 2 months ago
A Framework for Modeling the Appearance of 3D Articulated Figures
This paper describes a framework for constructing a linear subspace model of image appearance for complex articulated 3D figures such as humans and other animals. A commercial mo...
Hedvig Sidenbladh, Fernando De la Torre, Michael J...
IJCNN
2000
IEEE
14 years 2 months ago
VC Dimension Bounds for Product Unit Networks
A product unit is a formal neuron that multiplies its input values instead of summingthem. Furthermore, it has weights acting as exponents instead of being factors. We investigate...
Michael Schmitt
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
14 years 2 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
GLOBECOM
2007
IEEE
14 years 2 months ago
OFDMA Downlink Resource Allocation for Ergodic Capacity Maximization with Imperfect Channel Knowledge
In this paper, we derive an optimal resource allocation algorithm for ergodic weighted-sum capacity maximization in OFDMA systems assuming the availability of only partial (imperfe...
Ian C. Wong, Brian L. Evans
SIGIR
1995
ACM
14 years 1 months ago
A Trainable Document Summarizer
To summarize is to reducein complexity, and hencein length, while retaining some of the essential qualities of the original. This paper focusses on document extracts, a particular...
Julian Kupiec, Jan O. Pedersen, Francine Chen