227 search results - page 20 / 46 » Complexity Results for Compressing Optimal Paths |
127
click to vote
BTW
1993
Springer
15 years 3 months ago
1993
Springer
It is clearly crucial for the success of object-oriented databases to find effiĆ cient implementations that improve on the performance of relational sysĆ tems, rather than being...
SPAA
2005
ACM
15 years 4 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
114
click to vote
GECCO
2000
Springer
15 years 2 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
SPAA
2010
ACM
14 years 11 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
82
Voted
ICIP
2006
IEEE
16 years 24 days ago
2006
IEEE
Sub-pixel motion compensation plays an important role in compression efficiency within modern video codecs such as MPEG2, MPEG4 and H.264. Sub-pixel motion compensa tion is implem...