Sciweavers

2040 search results - page 135 / 408
» On the Complexity of Error Explanation
Sort
View
ICIP
2001
IEEE
14 years 11 months ago
Robust estimation of depth and motion using stochastic approximation
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
Rama Chellappa, Amit K. Roy Chowdhury
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 10 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
ICML
2006
IEEE
14 years 10 months ago
Efficient lazy elimination for averaged one-dependence estimators
Semi-naive Bayesian classifiers seek to retain the numerous strengths of naive Bayes while reducing error by weakening the attribute independence assumption. Backwards Sequential ...
Fei Zheng, Geoffrey I. Webb
PEPM
2009
ACM
14 years 6 months ago
Guided model checking for programs with polymorphism
Exhaustive model checking search techniques are ineffective for error discovery in large and complex multi-threaded software systems. Distance estimate heuristics guide the concre...
Neha Rungta, Eric G. Mercer
MIDDLEWARE
2009
Springer
14 years 3 months ago
Why Do Upgrades Fail and What Can We Do about It?
Abstract. Enterprise-system upgrades are unreliable and often produce downtime or data-loss. Errors in the upgrade procedure, such as broken dependencies, constitute the leading ca...
Tudor Dumitras, Priya Narasimhan