Sciweavers

78 search results - page 13 / 16
» Blind Deconvolution Using the Relative Newton Method
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Calibration from Statistical Properties of the Visual World
What does a blind entity need in order to determine the geometry of the set of photocells that it carries through a changing lightfield? In this paper, we show that very crude know...
Etienne Grossmann, José António Gasp...
TREC
1998
13 years 8 months ago
BBN at TREC7: Using Hidden Markov Models for Information Retrieval
We present a new method for information retrieval using hidden Markov models HMMs and relate our experience with this system on the TREC-7 ad hoc task. We develop a general framew...
David R. H. Miller, Tim Leek, Richard M. Schwartz
NETWORKING
2004
13 years 8 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
Li Zhou, Chinya V. Ravishankar
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
TSP
2008
90views more  TSP 2008»
13 years 7 months ago
Array-Based QR-RLS Multichannel Lattice Filtering
An array-based algorithm for multichannel lattice filtering is proposed. The filter is formed by a set of units that are adapted locally and concurrently using recursions that clos...
J. Gomes, V. A. N. Barroso