Sciweavers

990 search results - page 101 / 198
» Sub-Graphs of Complete Graph
Sort
View
CIE
2007
Springer
14 years 3 months ago
Input-Dependence in Function-Learning
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
Sanjay Jain, Eric Martin, Frank Stephan
IPPS
2006
IEEE
14 years 3 months ago
Parallelizing post-placement timing optimization
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
Jiyoun Kim, Marios C. Papaefthymiou, José N...
CPAIOR
2004
Springer
14 years 2 months ago
Cost Evaluation of Soft Global Constraints
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
Nicolas Beldiceanu, Thierry Petit
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 2 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
ICDAR
2003
IEEE
14 years 2 months ago
Fast Lexicon-Based Word Recognition in Noisy Index Card Images
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
Simon M. Lucas, Gregory Patoulas, Andy C. Downton