Sciweavers

187 search results - page 19 / 38
» On the uniform edge-partition of a tree
Sort
View
ICWS
2009
IEEE
15 years 4 months ago
DHT-Based Range Query Processing for Web Service Discovery
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing efficient Web service discovery. Range queries...
Yiming Zhang, Ling Liu, Dongsheng Li, Feng Liu, Xi...
ICIP
2007
IEEE
16 years 8 months ago
Perceptual Image Coding Based on a Maximum of Minimal Structural Similarity Criterion
Perceptual image coding algorithms typically impose perceptual modeling in a preprocessing stage. A perceptual normalization model is often used to transform the original image si...
Zhou Wang, Qiang Li, Xinli Shang
WETICE
2009
IEEE
16 years 1 months ago
Search Optimizations in Structured Peer-to-Peer Systems
Abstract—DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency ex...
Nuno Lopes, Carlos Baquero
MDM
2004
Springer
154views Communications» more  MDM 2004»
16 years 2 days ago
On Bulk Loading TPR-Tree
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...
Bin Lin, Jianwen Su
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
15 years 6 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger