Sciweavers

3891 search results - page 688 / 779
» Query Models
Sort
View
INFOCOM
2009
IEEE
15 years 9 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
IPPS
2009
IEEE
15 years 9 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 9 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
111
Voted
WEBI
2009
Springer
15 years 9 months ago
Learning Deep Web Crawling with Diverse Features
—The key to Deep Web crawling is to submit promising keywords to query form and retrieve Deep Web content efficiently. To select keywords, existing methods make a decision based ...
Lu Jiang, Zhaohui Wu, Qinghua Zheng, Jun Liu
XSYM
2009
Springer
264views Database» more  XSYM 2009»
15 years 9 months ago
From Entity Relationship to XML Schema: A Graph-Theoretic Approach
Abstract. We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constr...
Massimo Franceschet, Donatella Gubiani, Angelo Mon...