1026 search results - page 110 / 206 » On Finding Minimal w-cutset |
223
click to vote
PVLDB
2010
15 years 1 months ago
2010
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
231
click to vote
TASE
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
171
click to vote
CSDA
2006
15 years 6 months ago
2006
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
151
click to vote
ASAP
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
145
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
It is well known that the performance of quicksort can be improved by selecting the median of a sample of elements as the pivot of each partitioning stage. For large samples the pa...