Sciweavers

378 search results - page 26 / 76
» How Many Ways Can One Draw a Graph
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 8 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
INFOCOM
2008
IEEE
15 years 10 months ago
Complex Network Measurements: Estimating the Relevance of Observed Properties
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
Matthieu Latapy, Clémence Magnien
ICDM
2009
IEEE
202views Data Mining» more  ICDM 2009»
15 years 1 months ago
Link Prediction on Evolving Data Using Matrix and Tensor Factorizations
Abstract--The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In t...
Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda
ARCS
1997
Springer
15 years 8 months ago
Compiler Technology for Two Novel Computer Architectures
Before it can achieve wide acceptance, parallelcomputation must be made significantlyeasier to program. One ain obstacles to this goal is the current usage of memory, both abstra...
Ronald Moore, Bernd Klauer, Klaus Waldschmidt
CORR
2011
Springer
235views Education» more  CORR 2011»
14 years 10 months ago
On the accuracy of language trees
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available i...
Simone Pompei, Vittorio Loreto, Francesca Tria