Sciweavers

1623 search results - page 176 / 325
» No Sorting
Sort
View
JAL
2002
69views more  JAL 2002»
15 years 4 months ago
Rates of convergence for Quicksort
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
Ralph Neininger, Ludger Rüschendorf
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
15 years 4 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
RML
2002
84views Business» more  RML 2002»
15 years 4 months ago
Bringing a business rule perspective to resource discovery
The emergence of the Internet has changed the way in which many aspects of business are conducted. One such aspect, that of resource discovery, is being changed by the development ...
Carlos N. Cumberbatch, Suzanne M. Embury, Carole A...
TCSV
2002
67views more  TCSV 2002»
15 years 4 months ago
A new compression scheme for color-quantized images
An efficient compression scheme for color-quantized images based on progressive coding of color information has been developed. Instead of sorting color indexes into a linear list ...
Xin Chen, Sam Kwong, Ju-fu Feng
TKDE
2002
127views more  TKDE 2002»
15 years 4 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...