1749 search results - page 297 / 350 » Conditional colorings of graphs |
167
Voted
CPC
2010
15 years 2 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
175
click to vote
ICMLC
2010
Springer
15 years 2 months ago
2010
Springer
: This paper presents a system for predicting dangerous driving events while driving on an expressway. There are three major tasks involved in the prediction system: (1) how to per...
151
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We examine distributed time-synchronization in mobile ad-hoc and sensor networks. The problem is to estimate the skews and offsets of clocks of all the nodes with respect to an arb...
146
click to vote
JMLR
2010
14 years 11 months ago
2010
We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relatio...
168
click to vote
TON
2010
14 years 11 months ago
2010
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...