11740 search results - page 117 / 2348 » More Problems in Rewriting |
81
Voted
DCC
2006
IEEE
16 years 10 days ago
2006
IEEE
We discuss two approaches for decoding at arbitrary rates in the Slepian-Wolf problem - time sharing and source splitting - both of which rely on constituent vertex decoders. We c...
ESA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We evaluate the performance of FPT algorithms for the directed feedback vertex set problem (DFVS). We propose several new data reduction rules for DFVS. which can signi...
ISMIR
2005
Springer
15 years 6 months ago
2005
Springer
In the “query-by-humming” problem, we attempt to retrieve a specific song from a target set based on a sung query. Recent evaluations of query-by-humming systems show that th...
81
Voted
BIRTHDAY
2004
Springer
15 years 6 months ago
2004
Springer
del based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the ov...
100
Voted
CCCG
2007
15 years 2 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...