Sciweavers

9414 search results - page 1562 / 1883
» Adaptive Query Processing
Sort
View
CLUSTER
2009
IEEE
16 years 2 months ago
Analyzing massive astrophysical datasets: Can Pig/Hadoop or a relational DBMS help?
Abstract— As the datasets used to fuel modern scientific discovery grow increasingly large, they become increasingly difficult to manage using conventional software. Parallel d...
Sarah Loebman, Dylan Nunley, YongChul Kwon, Bill H...
IPPS
2009
IEEE
16 years 1 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»
16 years 1 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
WEBI
2009
Springer
16 years 1 months ago
Data Mining for Malicious Code Detection and Security Applications
: Data mining is the process of posing queries and extracting patterns, often previously unknown from large quantities of data using pattern matching or other reasoning techniques....
Bhavani M. Thuraisingham
CIKM
2009
Springer
16 years 1 months ago
Dissemination of heterogeneous XML data in publish/subscibe systems
The publish-subscribe paradigm is an effective approach for data publishers to asynchronously disseminate relevant data to a large number of data subscribers. A lot of recent res...
Yuan Ni, Chee Yong Chan
« Prev « First page 1562 / 1883 Last » Next »