5227 search results - page 82 / 1046 » Constructing New Media |
146
click to vote
JGAA
2006
15 years 4 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
141
click to vote
ACL
2003
15 years 6 months ago
2003
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
172
click to vote
CCECE
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
158
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper discusses the construction and implementation problem of trellis coded quantization (TCQ) based data hiding. We explore the robustness and distortion of data hiding by ...
118
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...