Sciweavers

2956 search results - page 349 / 592
» Targeted Data Prefetching
Sort
View
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
15 years 10 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
105
Voted
ICCBR
2009
Springer
15 years 10 months ago
Case-Based Collective Inference for Maritime Object Classification
Maritime assets such as merchant and navy ships, ports, and harbors, are targets of terrorist attacks as evidenced by the USS Cole bombing. Conventional methods of securing maritim...
Kalyan Moy Gupta, David W. Aha, Philip Moore
PKDD
2009
Springer
169views Data Mining» more  PKDD 2009»
15 years 10 months ago
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
Jeffrey Johns, Marek Petrik, Sridhar Mahadevan
123
Voted
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
15 years 10 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
COMSWARE
2007
IEEE
15 years 10 months ago
Scalable Multicast Platforms for a New Generation of Robust Distributed Applications
1 As distributed systems scale up and are deployed into increasingly sensitive settings, demand is rising for a new generation of communications middleware in support of applicati...
Ken Birman, Mahesh Balakrishnan, Danny Dolev, Tudo...