Sciweavers

790 search results - page 117 / 158
» Subexponential Parameterized Algorithms
Sort
View
ISPAN
2002
IEEE
15 years 11 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
DAC
1999
ACM
15 years 10 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
CPM
1999
Springer
99views Combinatorics» more  CPM 1999»
15 years 10 months ago
On the Complexity of Positional Sequencing by Hybridization
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Shara...
CVPR
2004
IEEE
15 years 9 months ago
Face Localization via Hierarchical CONDENSATION with Fisher Boosting Feature Selection
We formulate face localization as a Maximum A Posteriori Probability(MAP) problem of finding the best estimation of human face configuration in a given image. The a prior distribu...
Jilin Tu, ZhenQiu Zhang, Zhihong Zeng, Thomas S. H...
SIGGRAPH
1995
ACM
15 years 9 months ago
Plenoptic modeling: an image-based rendering system
Image-based rendering is a powerful new approach for generating real-time photorealistic computer graphics. It can provide convincing animations without an explicit geometric repr...
Leonard McMillan, Gary Bishop