Sciweavers

5640 search results - page 481 / 1128
» Parallelizing the Data Cube
Sort
View
182
Voted
EDBTW
2006
Springer
15 years 8 months ago
Dynamic Plan Migration for Snapshot-Equivalent Continuous Queries in Data Stream Systems
A data stream management system executes a large number of continuous queries in parallel. As stream characteristics and query workload change over time, the plan initially install...
Jürgen Krämer, Yin Yang, Michael Cammert...
INFOCOM
1995
IEEE
15 years 8 months ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
Wei Kang Tsai, John K. Antonio, Garng M. Huang
ACL
2006
15 years 6 months ago
Modeling Human Sentence Processing Data with a Statistical Parts-of-Speech Tagger
It has previously been assumed in the psycholinguistic literature that finite-state models of language are crucially limited in their explanatory power by the locality of the prob...
Jihyun Park
ICS
2011
Tsinghua U.
14 years 8 months ago
Scalable fine-grained call path tracing
Applications must scale well to make efficient use of even medium-scale parallel systems. Because scaling problems are often difficult to diagnose, there is a critical need for sc...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
ICFP
2012
ACM
13 years 7 months ago
Nested data-parallelism on the gpu
Graphics processing units (GPUs) provide both memory bandwidth and arithmetic performance far greater than that available on CPUs but, because of their Single-Instruction-Multiple...
Lars Bergstrom, John H. Reppy