2496 search results - page 146 / 500 » On covering by translates of a set |
138
click to vote
ACL
1993
15 years 7 months ago
1993
We show that feature logic extended by functional uncertainty is decidable, even if one admits cyclic descriptions. We present an algorithm, which solves feature descriptions cont...
153
click to vote
DISOPT
2006
15 years 6 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
136
click to vote
JCT
2008
15 years 6 months ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
178
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
142
click to vote
CCR
2004
15 years 6 months ago
2004
This paper introduces a new set of long duration captures of Internet traffic headers. The capture is being performed on a continuous on-going basis and is approaching a year in d...