2069 search results - page 182 / 414 » Linear time algorithms for Clobber |
144
click to vote
ESA
1998
Springer
15 years 9 months ago
1998
Springer
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
143
click to vote
ISCAS
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
138
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
170
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
143
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...