Sciweavers

3265 search results - page 23 / 653
» Representing Groups on Graphs
Sort
View
CN
2004
114views more  CN 2004»
14 years 11 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
JMLR
2010
134views more  JMLR 2010»
14 years 6 months ago
Inference of Graphical Causal Models: Representing the Meaningful Information of Probability Distributions
This paper studies the feasibility and interpretation of learning the causal structure from observational data with the principles behind the Kolmogorov Minimal Sufficient Statist...
Jan Lemeire, Kris Steenhaut
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
15 years 6 months ago
Algebraic visual analysis: the Catalano phone call data set case study
While many clever techniques have been proposed for visual analysis, most of these are “one of” and it is not easy to see how to combine multiple techniques. We propose an alg...
Anna A. Shaverdian, Hao Zhou, George Michailidis, ...
STACS
2000
Springer
15 years 3 months ago
On the Many Faces of Block Codes
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta...
JCT
2008
57views more  JCT 2008»
14 years 11 months ago
Invariant boundary distributions for finite graphs
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
Guyan Robertson