Sciweavers

5864 search results - page 172 / 1173
» Can We Work around Numerical Methods
Sort
View
169
Voted
HPDC
2011
IEEE
14 years 8 months ago
Algorithm-based recovery for iterative methods without checkpointing
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...
Zizhong Chen
136
Voted
AAAI
2008
15 years 6 months ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner
CVPR
2003
IEEE
16 years 6 months ago
Joint Manifold Distance: a new approach to appearance based clustering
We wish to match sets of images to sets of images where both sets are undergoing various distortions such as viewpoint and lighting changes. To this end we have developed a Joint ...
Andrew W. Fitzgibbon, Andrew Zisserman
VTC
2007
IEEE
111views Communications» more  VTC 2007»
15 years 10 months ago
Analysis of a Spline Based, Obstacle Avoiding Path Planning Algorithm
—The Overbot is one of the original DARPA Grand Challenge vehicles now being used as a platform for autonomous vehicle research. The vehicle, equipped with a complete actuator an...
John Connors, Gabriel Elkaim
105
Voted
NIPS
2003
15 years 6 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini