Sciweavers

3757 search results - page 424 / 752
» The overlap number of a graph
Sort
View
171
Voted
IPL
2006
115views more  IPL 2006»
15 years 6 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
EOR
2007
158views more  EOR 2007»
15 years 6 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...
PAMI
2006
156views more  PAMI 2006»
15 years 6 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
TIT
2008
127views more  TIT 2008»
15 years 6 months ago
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
Mohsen Bayati, Devavrat Shah, Mayank Sharma
CSL
2004
Springer
15 years 6 months ago
HyperLex: lexical cartography for information retrieval
This article describes an algorithm called HyperLex that is capable of automatically determining word uses in a textbase without recourse to a dictionary. The algorithm makes use ...
Jean Véronis