Sciweavers

316 search results - page 45 / 64
» On the Space Complexity of Randomized Synchronization
Sort
View
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
15 years 10 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
ICCVW
1999
Springer
15 years 2 months ago
A General Method for Feature Matching and Model Extraction
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
Clark F. Olson
AAAI
2008
15 years 9 days ago
A New Incomplete Method for CSP Inconsistency Checking
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
Belaid Benhamou, Mohamed Réda Saïdi
WSC
2007
15 years 9 days ago
Visualization techniques utilizing the sensitivity analysis of models
Models of real world systems are being increasingly generated from data that describes the behaviour of systems. Data mining techniques, such as Artificial Neural Networks (ANN),...
Ivo Kondapaneni, Pavel Kordík, Pavel Slav&i...
TCS
2008
14 years 10 months ago
Learning recursive functions: A survey
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...
Thomas Zeugmann, Sandra Zilles