Sciweavers

2398 search results - page 376 / 480
» Constraint Programming and Graph Algorithms
Sort
View
PLDI
1998
ACM
15 years 9 months ago
Quality and Speed in Linear-scan Register Allocation
A linear-scan algorithm directs the global allocation of register candidates to registers based on a simple linear sweep over the program being compiled. This approach to register...
Omri Traub, Glenn H. Holloway, Michael D. Smith
SIGCSE
1997
ACM
121views Education» more  SIGCSE 1997»
15 years 9 months ago
Application-based modules using apprentice learning for CS 2
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
Owen L. Astrachan, Robert F. Smith, James T. Wilke...
ICPR
2006
IEEE
16 years 5 months ago
Recover Writing Trajectory from Multiple Stroked Image Using Bidirectional Dynamic Search
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
Yu Qiao, Makoto Yasuhara
ICASSP
2008
IEEE
15 years 11 months ago
Probabilistic structural alignment of RNA sequences
We propose an algorithm for estimating the common secondary structure, alignment, and posterior base pairing probabilities for two RNA sequences. A definition of structural align...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...
CP
2005
Springer
15 years 10 months ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...