Sciweavers

19 search results - page 1 / 4
» Partition and Conquer
Sort
View
COSIT
1997
Springer
102views GIS» more  COSIT 1997»
13 years 8 months ago
Partition and Conquer
Abstract. Although maps and partitions are ubiquitous in geographical information systems and spatial databases, there is only little work investigating their foundations. We give ...
Martin Erwig, Markus Schneider
WWW
2008
ACM
13 years 4 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
VLSID
2002
IEEE
131views VLSI» more  VLSID 2002»
14 years 5 months ago
Divide-and-Conquer IDDQ Testing for Core-Based System Chips
IDDQ testing has been used as a test technique to supplement voltage testing of CMOS chips. The idea behind IDDQ testing is to declare a chip as faulty if the steady-state current...
C. P. Ravikumar, Rahul Kumar
DAM
2006
79views more  DAM 2006»
13 years 4 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean
COMPSAC
2006
IEEE
13 years 10 months ago
Data Structure and Algorithm in Data Mining: Granular Computing View
This paper discusses foundations of conventional style of rule mining in which rules are extracted from a data table. Rule mining mainly uses the structure of a table, data partit...
Shusaku Tsumoto