Sciweavers

2836 search results - page 111 / 568
» Parsing Algorithms and Metrics
Sort
View
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
13 years 8 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
PEPM
1993
ACM
14 years 1 days ago
Partial Evaluation of General Parsers
Applications of partial evaluation have so far mainly focused on generation of compilers from interpreters for programming languages. We partially evaluate a simple general LR(k) ...
Christian Mossin
PIMRC
2008
IEEE
14 years 2 months ago
Algorithmic aspects of radio flexibility
—This review article explores the notion of radio flexibility, its various versions (as presented in a brief taxonomy) and its efficient instantiations under various metrics, pri...
Andreas Polydoros
FSTTCS
1993
Springer
14 years 1 days ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
ICMCS
2006
IEEE
146views Multimedia» more  ICMCS 2006»
14 years 2 months ago
A Mutual Information based Face Clustering Algorithm for Movies
In this paper a new approach for face clustering is developed. Mutual information and joint entropy are exploited in order to create a metric for the clustering process. The way t...
Nicholas Vretos, Vassilios Solachidis, Ioannis Pit...