Sciweavers

505 search results - page 19 / 101
» Universal Constructions for Large Objects
Sort
View
117
Voted
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 2 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
SIAMSC
2008
129views more  SIAMSC 2008»
15 years 1 months ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros
ICML
2009
IEEE
16 years 2 months ago
Learning non-redundant codebooks for classifying complex objects
Codebook-based representations are widely employed in the classification of complex objects such as images and documents. Most previous codebook-based methods construct a single c...
Wei Zhang, Akshat Surve, Xiaoli Fern, Thomas G. Di...
ICIP
2008
IEEE
16 years 3 months ago
Live video object tracking and segmentation using graph cuts
Graph cuts have proven to be powerful tools in image segmentation. Previous graph cut research has proposed methods for cutting across large graphs constructed from multiple layer...
Zachary A. Garrett, Hideo Saito
174
Voted
DAWAK
2011
Springer
14 years 1 months ago
OLAP Formulations for Supporting Complex Spatial Objects in Data Warehouses
In recent years, there has been a large increase in the amount of spatial data obtained from remote sensing, GPS receivers, communication terminals and other domains. Data warehous...
Ganesh Viswanathan, Markus Schneider