Sciweavers

1007 search results - page 121 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
IJVR
2006
166views more  IJVR 2006»
15 years 2 months ago
Multi-screen Tiled Displayed, Parallel Rendering System for a Large Terrain Dataset
Real time terrain rendering plays a very important role in many fields, such of GIS, virtual reality, and military simulations. With the rapid development of PC-level hardware, rec...
Ping Yin, Xiaohong Jiang, Jiaoying Shi, Ran Zhou
118
Voted
SAC
2002
ACM
15 years 2 months ago
Statistical properties of the simulated time horizon in conservative parallel discrete-event simulations
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2]...
G. Korniss, M. A. Novotny, A. K. Kolakowska, H. Gu...
IPPS
2009
IEEE
15 years 9 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
PPDP
2010
Springer
15 years 14 days ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
132
Voted
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 3 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera