Sciweavers

3678 search results - page 379 / 736
» On the Stable Paths Problem
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart
RSA
2010
98views more  RSA 2010»
15 years 5 months ago
Network delay inference from additive metrics
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
Shankar Bhamidi, Ram Rajagopal, Sébastien R...
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
15 years 1 months ago
Control of a bicycle using virtual holonomic constraints
The problem of making a bicycle trace a strictly convex Jordan curve with bounded roll angle and bounded speed is investigated. The problem is solved by enforcing a virtual holonom...
Luca Consolini, Manfredi Maggiore
WISA
2009
Springer
16 years 1 months ago
Securing Remote Access Inside Wireless Mesh Networks
Wireless mesh networks (WMNs) that are being increasingly deployed in communities and public places provide a relatively stable routing infrastructure and can be used for diverse c...
Mark Manulis
170
Voted
IMC
2009
ACM
16 years 1 months ago
Triangle inequality variations in the internet
Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by findi...
Cristian Lumezanu, Randolph Baden, Neil Spring, Bo...