Sciweavers

866 search results - page 112 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
AAAI
2012
11 years 11 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
CVPR
2007
IEEE
14 years 11 months ago
Image Segmentation by Probabilistic Bottom-Up Aggregation and Cue Integration
We present a parameter free approach that utilizes multiple cues for image segmentation. Beginning with an image, we execute a sequence of bottom-up aggregation steps in which pix...
Sharon Alpert, Meirav Galun, Ronen Basri, Achi Bra...
CVPR
2010
IEEE
14 years 5 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
SAC
2004
ACM
14 years 2 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
LREC
2008
129views Education» more  LREC 2008»
13 years 10 months ago
Chinese Core Ontology Construction from a Bilingual Term Bank
A core ontology is a mid-level ontology which bridges the gap between an upper ontology and a domain ontology. Automatic Chinese core ontology construction can help quickly model ...
Yi-Rong Chen, Qin Lu, Wenjie Li, Gaoying Cui