Sciweavers

3225 search results - page 366 / 645
» Measures of Similarity
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
16 years 1 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
SBACPAD
2005
IEEE
176views Hardware» more  SBACPAD 2005»
16 years 6 days ago
Analyzing and Improving Clustering Based Sampling for Microprocessor Simulation
The time required to simulate a complete benchmark program using the cycle-accurate model of a microprocessor can be prohibitively high. One of the proposed methodologies, represe...
Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy Kuri...
ASIACRYPT
2001
Springer
15 years 11 months ago
Responsive Round Complexity and Concurrent Zero-Knowledge
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Tzafrir Cohen, Joe Kilian, Erez Petrank
ICRA
1998
IEEE
148views Robotics» more  ICRA 1998»
15 years 11 months ago
Position Estimation Using Principal Components of Range Data
1 sensors is to construct a structural description from sensor data and to match this description to a previously acquired model [Crowley 85]. An alternative is to project individu...
James L. Crowley, Frank Wallner, Bernt Schiele
BMCBI
2010
138views more  BMCBI 2010»
15 years 6 months ago
UFFizi: a generic platform for ranking informative features
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...
Assaf Gottlieb, Roy Varshavsky, Michal Linial, Dav...