Sciweavers

1859 search results - page 337 / 372
» Sketch-based path design
Sort
View
140
Voted
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 4 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
134
Voted
SIGCOMM
2010
ACM
15 years 3 months ago
Source flow: handling millions of flows on flow-based nodes
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
Yasunobu Chiba, Yusuke Shinohara, Hideyuki Shimoni...
162
Voted
CL
2008
Springer
15 years 3 months ago
Efficient exception handling in Java bytecode-to-C ahead-of-time compiler for embedded systems
One of the most promising approaches to Java acceleration in embedded systems is a bytecode-to-C ahead-of-time compiler (AOTC). It improves the performance of a Java virtual machi...
Dong-Heon Jung, Jong Kuk Park, Sung-Hwan Bae, Jaem...
118
Voted
CCR
2007
135views more  CCR 2007»
15 years 3 months ago
Future internet: fundamentals and measurement
While the Internet is hardly “broken”, it has proved unable to integrate new ideas, new architectures, and provide paths for future integration of data, voice, rich media and ...
Thrasyvoulos Spyropoulos, Serge Fdida, Scott Kirkp...
CORR
2007
Springer
170views Education» more  CORR 2007»
15 years 3 months ago
Animation of virtual mannequins, robot-like simulation or motion captures
— In order to optimize the costs and time of design of the new products while improving their quality, concurrent engineering is based on the digital model of these products, the...
Damien Chablat