Sciweavers

895 search results - page 121 / 179
» Triangulating Topological Spaces
Sort
View
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
14 years 10 days ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
UAI
1996
14 years 6 days ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
Yousri El Fattah, Rina Dechter
ACS
2007
13 years 11 months ago
Choiceless, Pointless, but not Useless: Dualities for Preframes
We provide the appropriate common ‘(pre)framework’ for various central results of domain theory and topology, like the Lawson duality of continuous domains, the Hofmann–Lawso...
Marcel Erné
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 11 months ago
Mapping Semantic Networks to Undirected Networks
Abstract--There exists an injective, information-preserving function that maps a semantic network (i.e a directed labeled network) to a directed network (i.e. a directed unlabeled ...
Marko A. Rodriguez
INFOCOM
2010
IEEE
13 years 9 months ago
How do Superpeer Networks Emerge?
—In this paper, we develop an analytical framework which explains the emergence of superpeer networks on execution of the commercial peer-to-peer bootstrapping protocols by incom...
Bivas Mitra, Abhishek Kumar Dubey, Sujoy Ghose, Ni...