Sciweavers

5055 search results - page 980 / 1011
» Relative Timing
Sort
View
JCM
2008
63views more  JCM 2008»
13 years 8 months ago
A Node Encoding of Torus Topology and Its Improved Routing Algorithm
With the feature size of semiconductor technology reducing and intellectual properties (IP) cores increasing, on chip communication architectures have a great influence on the perf...
Xiaoqiang Yang, Junmin Li, Huimin Du, Jungang Han
CORR
2007
Springer
170views Education» more  CORR 2007»
13 years 8 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
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 8 months ago
Anonymous Networking amidst Eavesdroppers
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
Parvathinathan Venkitasubramaniam, Ting He, Lang T...
JACM
2006
99views more  JACM 2006»
13 years 8 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
DAM
2007
107views more  DAM 2007»
13 years 8 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...