Sciweavers

1071 search results - page 82 / 215
» An analysis framework for search sequences
Sort
View
AAAI
1993
13 years 10 months ago
Scientific Model-Building as Search in Matrix Spaces
Many reported discovery systems build discrete models of hidden structure, properties, or processes in the diverse fields of biology, chemistry, and physics. We show that the sear...
Raúl E. Valdés-Pérez, Jan M. ...
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
13 years 10 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
CGO
2007
IEEE
14 years 3 months ago
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
Emerging microprocessors offer unprecedented parallel computing capabilities and deeper memory hierarchies, increasing the importance of loop transformations in optimizing compile...
Louis-Noël Pouchet, Cédric Bastoul, Al...
ICPR
2008
IEEE
14 years 10 months ago
Using web search engines to improve text recognition
In this paper we introduce a framework for automated text recognition from images. We first describe a simple but efficient text detection and recognition method based on analysis...
Horst Bischof, Michael Donoser, Silke Wagner
CAV
2012
Springer
223views Hardware» more  CAV 2012»
11 years 11 months ago
Detecting Fair Non-termination in Multithreaded Programs
Abstract. We develop compositional analysis algorithms for detecting nontermination in multithreaded programs. Our analysis explores fair and ultimatelyperiodic executions—i.e., ...
Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi...