Sciweavers

499 search results - page 93 / 100
» A Search Algorithm for Clusters in a Network or Graph
Sort
View
AI
2002
Springer
13 years 7 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
PDIS
1996
IEEE
13 years 11 months ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo
WWW
2006
ACM
14 years 8 months ago
Web ontology segmentation: analysis, classification and use
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...
Julian Seidenberg, Alan L. Rector
JCIT
2008
138views more  JCIT 2008»
13 years 7 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
KDD
2012
ACM
229views Data Mining» more  KDD 2012»
11 years 10 months ago
Finding trendsetters in information networks
Influential people have an important role in the process of information diffusion. However, there are several ways to be influential, for example, to be the most popular or the...
Diego Sáez-Trumper, Giovanni Comarela, Virg...