Sciweavers

213 search results - page 21 / 43
» An Approximation Algorithm for Binary Searching in Trees
Sort
View
DAM
2008
135views more  DAM 2008»
13 years 7 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
INFOCOM
2006
IEEE
14 years 1 months ago
Optimal Power Allocation in Wireless Networks with Transmitter-Receiver Power Tradeoffs
— For many wireless communication links, such as those employing turbo codes or sequentially-decoded convolutional codes, the power consumption of the decoder at the receiver dep...
Sudarshan Vasudevan, Chun Zhang, Dennis Goeckel, D...
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
13 years 12 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
PAMI
2011
13 years 2 months ago
Bilayer Segmentation of Webcam Videos Using Tree-Based Classifiers
—This paper presents an automatic segmentation algorithm for video frames captured by a (monocular) webcam that closely approximates depth segmentation from a stereo camera. The ...
Pei Yin, Antonio Criminisi, John M. Winn, Irfan A....
ECCV
2002
Springer
14 years 9 months ago
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
Hedvig Sidenbladh, Michael J. Black, Leonid Sigal