Sciweavers

2398 search results - page 384 / 480
» Constraint Programming and Graph Algorithms
Sort
View
141
Voted
UAI
1997
15 years 4 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
125
Voted
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
15 years 7 months ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek
113
Voted
ICML
2007
IEEE
16 years 3 months ago
Structural alignment based kernels for protein structure classification
Structural alignments are the most widely used tools for comparing proteins with low sequence similarity. The main contribution of this paper is to derive various kernels on prote...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
132
Voted
ISSS
1999
IEEE
149views Hardware» more  ISSS 1999»
15 years 7 months ago
A Buffer Merging Technique for Reducing Memory Requirements of Synchronous Dataflow Specifications
Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem duri...
Praveen K. Murthy, Shuvra S. Bhattacharyya
137
Voted
ASPDAC
2001
ACM
137views Hardware» more  ASPDAC 2001»
15 years 6 months ago
Optimized address assignment for DSPs with SIMD memory accesses
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
Markus Lorenz, David Koffmann, Steven Bashford, Ra...