Sciweavers

6757 search results - page 1320 / 1352
» Knowledge Analysis on Process Models
Sort
View
WWW
2008
ACM
13 years 8 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
BMCBI
2008
121views more  BMCBI 2008»
13 years 9 months ago
Microarray data mining using landmark gene-guided clustering
Background: Clustering is a popular data exploration technique widely used in microarray data analysis. Most conventional clustering algorithms, however, generate only one set of ...
Pankaj Chopra, Jaewoo Kang, Jiong Yang, HyungJun C...
ICCV
2007
IEEE
14 years 10 months ago
Real-Time Visibility-Based Fusion of Depth Maps
We present a viewpoint-based approach for the quick fusion of multiple stereo depth maps. Our method selects depth estimates for each pixel that minimize violations of visibility ...
Paul Merrell, Amir Akbarzadeh, Liang Wang, Philipp...
WWW
2002
ACM
14 years 9 months ago
Topic-sensitive PageRank
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the rel...
Taher H. Haveliwala
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 9 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
« Prev « First page 1320 / 1352 Last » Next »