EACL
2006
ACL Anthology
13 years 11 months ago
2006
ACL Anthology
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 ...
FIMI
2004
13 years 11 months ago
2004
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...
CCCG
2006
13 years 11 months ago
2006
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...
ACID
2006
13 years 11 months ago
2006
ACID
2006
13 years 11 months ago
2006
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 ...
ACID
2006
13 years 11 months ago
2006
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 ...
ACID
2006
13 years 11 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
ACID
2006
13 years 11 months ago
2006
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...
ACID
2006
13 years 11 months ago
2006
ACID
2006
13 years 11 months ago
2006
