Sciweavers

2310 search results - page 350 / 462
» Coloring Random Graphs
Sort
View
ACST
2006
13 years 9 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
NIPS
2001
13 years 9 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 8 months ago
Techniques for Enhanced Physical-Layer Security
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...
Pedro C. Pinto, João Barros, Moe Z. Win
MSS
2008
IEEE
88views Hardware» more  MSS 2008»
13 years 8 months ago
Cubical token systems
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a t...
Sergei Ovchinnikov
JMLR
2010
158views more  JMLR 2010»
13 years 2 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe