Sciweavers

1170 search results - page 86 / 234
» How Fast Is Too Fast
Sort
View
FAST
2008
15 years 5 months ago
EIO: Error Handling is Occasionally Correct
The reliability of file systems depends in part on how well they propagate errors. We develop a static analysis technique, EDP, that analyzes how file systems and storage device d...
Haryadi S. Gunawi, Cindy Rubio-González, An...
ICDM
2010
IEEE
119views Data Mining» more  ICDM 2010»
15 years 1 months ago
Visually Controllable Data Mining Methods
A large number of data mining methods are, as such, not applicable to fast, intuitive, and interactive use. Thus, there is a need for visually controllable data mining methods. Suc...
Kai Puolamäki, Panagiotis Papapetrou, Jefrey ...
CVPR
2004
IEEE
16 years 5 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
CVPR
2005
IEEE
16 years 5 months ago
Randomized Trees for Real-Time Keypoint Recognition
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
Vincent Lepetit, Pascal Lagger, Pascal Fua
CVPR
2007
IEEE
16 years 5 months ago
Efficient Indexing For Articulation Invariant Shape Matching And Retrieval
Most shape matching methods are either fast but too simplistic to give the desired performance or promising as far as performance is concerned but computationally demanding. In th...
Soma Biswas, Gaurav Aggarwal, Rama Chellappa