2796 search results - page 415 / 560 » The coolest path problem |
189
click to vote
PKDD
2005
Springer
15 years 12 months ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
166
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— In this paper we consider the problem of collecting a large amount of data from several different hosts to a single destination in a wide-area network. Often, due to congestion...
149
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
159
click to vote
GLVLSI
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
148
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...