3192 search results - page 633 / 639 » The minimum latency problem |
130
Voted
TVCG
2008
15 years 3 months ago
2008
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...
150
click to vote
BMCBI
2004
15 years 3 months ago
2004
Background: Within the peer-reviewed literature, associations between two things are not always recognized until commonalities between them become apparent. These commonalities ca...
134
Voted
JACM
2000
15 years 3 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
154
click to vote
COMBINATORICS
1998
15 years 3 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
111
click to vote
MMS
1998
15 years 3 months ago
1998
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for variable network delays. In this paper, we consider the ...