Sciweavers

1578 search results - page 83 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
110
Voted
DAC
2009
ACM
16 years 3 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu
177
Voted
MOBIHOC
2012
ACM
13 years 5 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
114
Voted
FDG
2009
ACM
15 years 9 months ago
Motion and scene complexity for streaming video games
This work provides detailed measurements of the motion and scene complexity for a wide variety of video games. Novel algorithms to measure motion and scene complexity are presente...
Mark Claypool
125
Voted
CGF
2008
130views more  CGF 2008»
15 years 2 months ago
Reduced Depth and Visual Hulls of Complex 3D Scenes
Depth and visual hulls are useful for quick reconstruction and rendering of a 3D object based on a number of reference views. However, for many scenes, especially multi-object, th...
Alexander Bogomjakov, Craig Gotsman
138
Voted
ICDCS
1999
IEEE
15 years 7 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta