Sciweavers

17185 search results - page 3414 / 3437
» Computational and Quantitative Studies
Sort
View
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 3 months ago
Kron Reduction of Graphs with Applications to Electrical Networks
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
Florian Dörfler, Francesco Bullo
CIKM
2010
Springer
13 years 3 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
DM
2011
253views Education» more  DM 2011»
13 years 3 months ago
On the hyperbolicity constant in graphs
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hy...
José M. Rodríguez, Jose Maria Sigarr...
ECCC
2011
207views ECommerce» more  ECCC 2011»
13 years 3 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
IANDC
2011
129views more  IANDC 2011»
13 years 3 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
« Prev « First page 3414 / 3437 Last » Next »