Sciweavers

790 search results - page 100 / 158
» Subexponential Parameterized Algorithms
Sort
View
CAISE
2006
Springer
15 years 6 months ago
A Tool for Semi-Automated Semantic Schema Mapping: Design and Implementation
Recently, schema mapping has found considerable interest in both research and practice. Determining matching components of database or XML schemas is needed in many applications, e...
Dimitris Manakanatas, Dimitris Plexousakis
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 3 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
135
Voted
GLOBECOM
2009
IEEE
15 years 9 months ago
Sparse Decoding of Low Density Parity Check Codes Using Margin Propagation
—One of the key factors underlying the popularity of Low-density parity-check (LDPC) code is its iterative decoding algorithm that is amenable to efficient hardware implementati...
Ming Gu, Kiran Misra, Hayder Radha, Shantanu Chakr...
CVPR
2006
IEEE
16 years 5 months ago
Meta-Evaluation of Image Segmentation Using Machine Learning
Image segmentation is a fundamental step in many computer vision applications. Generally, the choice of a segmentation algorithm, or parameterization of a given algorithm, is sele...
Hui Zhang, Sharath R. Cholleti, Sally A. Goldman, ...
APPROX
2008
Springer
173views Algorithms» more  APPROX 2008»
15 years 5 months ago
Connected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
Jean Cardinal, Eythan Levy