Sciweavers

3204 search results - page 367 / 641
» The b-chromatic Number of a Graph
Sort
View
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 6 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
209
Voted
GLOBECOM
2007
IEEE
16 years 1 months ago
Loss Tomography in General Topologies with Network Coding
Abstract— Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general...
Minas Gjoka, Christina Fragouli, Pegah Sattari, At...
CVIU
2008
141views more  CVIU 2008»
15 years 6 months ago
Change detection using a statistical model in an optimally selected color space
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
Youngbae Hwang, Jun-Sik Kim, In-So Kweon
DEDS
2006
111views more  DEDS 2006»
15 years 6 months ago
Model Checking of Time Petri Nets Using the State Class Timed Automaton
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
Didier Lime, Olivier H. Roux
JSAC
2008
98views more  JSAC 2008»
15 years 6 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri