223 search results - page 18 / 45 » On Computing Longest Paths in Small Graph Classes |
DCC
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...
ICSE
2003
IEEE-ACM
15 years 11 months ago
2003
IEEE-ACM
Impact analysis, determining when a change in one part of a program affects other parts of the program, is timeconsuming and problematic. Impact analysis is rarely used to predict...
115
click to vote
CONSTRAINTS
2006
14 years 11 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
ICNP
2009
IEEE
15 years 6 months ago
2009
IEEE
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
82
Voted
CORR
2007
Springer
14 years 11 months ago
2007
Springer
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...