Sciweavers

2398 search results - page 259 / 480
» Constraint Programming and Graph Algorithms
Sort
View
173
Voted
ACL
2010
15 years 4 months ago
Untangling the Cross-Lingual Link Structure of Wikipedia
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
Gerard de Melo, Gerhard Weikum
183
Voted
ICSM
2007
IEEE
16 years 22 days ago
Matching Control Flow of Program Versions
In many application areas, including piracy detection, software debugging and maintenance, situations arise in which there is a need for comparing two versions of a program that d...
Vijayanand Nagarajan, Rajiv Gupta, Matias Madou, X...
CORR
2007
Springer
130views Education» more  CORR 2007»
15 years 6 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
CSR
2008
Springer
15 years 8 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma
179
Voted
ATAL
2009
Springer
16 years 1 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein