4114 search results - page 16 / 823 » Efficient Algorithms for the 2-Center Problems |
144
click to vote
COLING
2010
14 years 11 months ago
2010
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
144
click to vote
JCSS
2002
15 years 3 months ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
123
Voted
ICCAD
2009
IEEE
15 years 1 months ago
2009
IEEE
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
129
Voted
RTAS
2010
IEEE
15 years 2 months ago
2010
IEEE
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is be...
142
click to vote
PVLDB
2008
15 years 3 months ago
2008
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...