553 search results - page 91 / 111 » Cluster computing for web-scale data processing |
SSDBM
2010
IEEE
13 years 5 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
SBACPAD
2003
IEEE
14 years 24 days ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
SIGGRAPH
2010
ACM
14 years 1 days ago
2010
ACM
Recent advances in scanning technologies, in particular devices that extract depth through active sensing, allow fast scanning of urban scenes. Such rapid acquisition incurs imper...
SIAMSC
2008
13 years 7 months ago
2008
In this paper we propose a novel computational technique to solve the Eikonal equation. The proposed method manages the list of active nodes and iteratively updates the solutions ...
PC
2007
13 years 7 months ago
2007
Parallel volume rendering is one of the most efficient techniques to achieve real time visualization of large datasets by distributing the data and the rendering process over a c...