Sciweavers

1290 search results - page 101 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
OOPSLA
2010
Springer
15 years 4 months ago
Specifying and implementing refactorings
Modern IDEs for object-oriented languages like Java provide support for a basic set of simple automated refactorings whose behaviour is easy to describe intuitively. It is, howeve...
Max Schäfer, Oege de Moor
CVPR
2005
IEEE
16 years 8 months ago
Coupled PDEs for Non-Rigid Registration and Segmentation
In this paper we present coupled partial differential equations (PDEs) for the problem of joint segmentation and registration. The registration component of the method estimates a...
Gozde B. Unal, Gregory G. Slabaugh
EMNLP
2008
15 years 7 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
PVLDB
2010
103views more  PVLDB 2010»
15 years 4 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
INFOCOM
2008
IEEE
16 years 24 days ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu