Sciweavers

148 search results - page 22 / 30
» On Perfect Completeness for QMA
Sort
View
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
13 years 11 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang
DAGM
2006
Springer
13 years 11 months ago
On-Line, Incremental Learning of a Robust Active Shape Model
Abstract. Active Shape Models are commonly used to recognize and locate different aspects of known rigid objects. However, they require an off-line learning stage, such that the ex...
Michael Fussenegger, Peter M. Roth, Horst Bischof,...
EUROPAR
2008
Springer
13 years 9 months ago
Efficiently Building the Gated Single Assignment Form in Codes with Pointers in Modern Optimizing Compilers
Abstract. Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs characterize the behavior of code ...
Manuel Arenaz, Pedro Amoedo, Juan Touriño
PDPTA
2004
13 years 9 months ago
Design of a Real-Time Scheduler for Kahn Process Networks on Multiprocessor Systems
High-throughput real-time systems require non-standard and costly hardware and software solutions. Modern workstation can represent a credible alternative to develop realtime inte...
Javed Dulloo, Philippe Marquet
ISMB
1996
13 years 9 months ago
Gene Prediction by Pattern Recognition and Homology Search
This paper presents an algorithm for combining pattern recognition-based exon prediction and database homologysearch in gene model construction. Thegoal is to use homologousgeneso...
Ying Xu, Edward C. Uberbacher