Sciweavers

565 search results - page 36 / 113
» Parallel Querying with Non-Dedicated Computers
Sort
View
DEBS
2007
ACM
13 years 12 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
ICS
2010
Tsinghua U.
14 years 21 days ago
A query language for understanding component interactions in production systems
When something unexpected happens in a large production system, administrators must first perform a search to isolate which components and component interactions are likely to be...
Adam J. Oliner, Alex Aiken
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 12 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
14 years 5 days ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud