Sciweavers

976 search results - page 157 / 196
» A Framework for Querying Pedigree Data
Sort
View
IJAIT
2002
92views more  IJAIT 2002»
13 years 8 months ago
Extensible Information Brokers
The number and size of information services available on the internet has been growing exponentially over the past few years. This growth has created an urgent need for information...
Jianguo Lu, John Mylopoulos
SSDBM
2005
IEEE
122views Database» more  SSDBM 2005»
14 years 2 months ago
Detection and Tracking of Discrete Phenomena in Sensor-Network Databases
This paper introduces a framework for Phenomena Detection and Tracking (PDT, for short) in sensor network databases. Examples of detectable phenomena include the propagation over ...
Mohamed H. Ali, Mohamed F. Mokbel, Walid G. Aref, ...
ICDE
2006
IEEE
136views Database» more  ICDE 2006»
14 years 10 months ago
XCluster Synopses for Structured XML Content
We tackle the difficult problem of summarizing the path/branching structure and value content of an XML database that comprises both numeric and textual values. We introduce a nov...
Neoklis Polyzotis, Minos N. Garofalakis
ARCS
2004
Springer
14 years 2 months ago
Latent Semantic Indexing in Peer-to-Peer Networks
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
Xuezheng Liu, Ming Chen, Guangwen Yang
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 2 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han