Sciweavers

2219 search results - page 328 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
131
Voted
COCOA
2007
Springer
15 years 9 months ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar
100
Voted
DAC
2009
ACM
16 years 3 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
120
Voted
ECOOP
1997
Springer
15 years 6 months ago
Near Optimal Hierarchical Encoding of Types
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
Andreas Krall, Jan Vitek, R. Nigel Horspool
133
Voted
ESWS
2008
Springer
15 years 4 months ago
Instance Based Clustering of Semantic Web Resources
Abstract. The original Semantic Web vision was explicit in the need for intelligent autonomous agents that would represent users and help them navigate the Semantic Web. We argue t...
Gunnar Aastrand Grimnes, Peter Edwards, Alun D. Pr...
148
Voted
CVPR
2010
IEEE
15 years 8 months ago
Semantic Context Modeling with Maximal Margin Conditional Random Fields for Automatic Image Annotation
Context modeling for Vision Recognition and Automatic Image Annotation (AIA) has attracted increasing attentions in recent years. For various contextual information and resources,...
Yu Xiang, Xiangdong Zhou, Zuotao Liu, Tat-seng chu...