1369 search results - page 223 / 274 » Lattice computations for random numbers |
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
ICWS
2008
IEEE
13 years 10 months ago
2008
IEEE
In service computing, the behavior of a service may evolve. When an organization develops a service-oriented application in which certain services are provided by external partner...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...