Sciweavers

1346 search results - page 150 / 270
» On the number of rectangular partitions
Sort
View
101
Voted
DBISP2P
2004
Springer
150views Database» more  DBISP2P 2004»
15 years 7 months ago
Adapting the Content Native Space for Load Balanced Indexing
Today, there is an increasing demand to share data with complex data types (e.g., multi-dimensional) over large numbers of data sources. One of the key challenges is sharing these ...
Yanfeng Shu, Kian-Lee Tan, Aoying Zhou
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
15 years 7 months ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel
FPL
2004
Springer
95views Hardware» more  FPL 2004»
15 years 7 months ago
Solving SAT with a Context-Switching Virtual Clause Pipeline and an FPGA Embedded Processor
Abstract. This paper proposes an architecture that combines a contextswitching virtual configware/software SAT solver with an embedded processor to promote a tighter coupling betwe...
C. J. Tavares, C. Bungardean, G. M. Matos, Jos&eac...
IPSN
2004
Springer
15 years 7 months ago
How to distribute sensors in a random field?
In this paper, we study the optimal way of distributing sensors in a random field to minimize the estimation distortion. We show that this problem is equivalent to certain proble...
Xin Zhang, Stephen B. Wicker
ATAL
2003
Springer
15 years 6 months ago
Strategies for the Increased Robustness of Ant-Based Clustering
This paper introduces a set of algorithmic modifications that improve the partitioning results obtained with ant-based clustering. Moreover, general parameter settings and a self-...
Julia Handl, Joshua D. Knowles, Marco Dorigo