7978 search results - page 442 / 1596 » Combining shared-coin algorithms |
230
click to vote
CODES
2003
IEEE
16 years 2 days ago
2003
IEEE
In this paper, we describe a new methodology based on game theory for minimizing the average power of a circuit during scheduling in behavioral synthesis. The problem of schedulin...
179
click to vote
QSIC
2003
IEEE
16 years 1 days ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
171
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
191
click to vote
MCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
218
click to vote
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
Mosaicingand super resolution are two ways to combine information from multiple frames in video sequences. Mosaicing displays the information of multiple frames in a single panora...