Sciweavers

EACL
2006
ACL Anthology
14 years 1 months ago
Example-Based Metonymy Recognition for Proper Nouns
Metonymy recognition is generally approached with complex algorithms that rely heavily on the manual annotation of training and test data. This paper will relieve this complexity ...
Yves Peirsman
FIMI
2004
268views Data Mining» more  FIMI 2004»
14 years 1 months ago
Algorithmic Features of Eclat
Nowadays basic algorithms such as Apriori and Eclat often are conceived as mere textbook examples without much practical applicability: in practice more sophisticated algorithms w...
Lars Schmidt-Thieme
CCCG
2006
14 years 1 months ago
Routing with Guaranteed Delivery on Virtual Coordinates
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...
Mirela Ben-Chen, Craig Gotsman, Steven J. Gortler
ACID
2006
518views Algorithms» more  ACID 2006»
14 years 1 months ago
The Computer System GRAPHOGRAPH
Vadim E. Zverovich
ACID
2006
298views Algorithms» more  ACID 2006»
14 years 1 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
ACID
2006
237views Algorithms» more  ACID 2006»
14 years 1 months ago
Parameterized Complexity of Finding Regular Induced Subgraphs
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
Hannes Moser, Dimitrios M. Thilikos
ACID
2006
264views Algorithms» more  ACID 2006»
14 years 1 months ago
A Parameterized View on Matroid Optimization Problems
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
Dániel Marx
ACID
2006
239views Algorithms» more  ACID 2006»
14 years 1 months ago
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
Robert W. Irving, David Manlove, Gregg O'Malley