Sciweavers

365 search results - page 10 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
CGVR
2006
13 years 9 months ago
Image Reconstruction Scheme for Watersheds based Video Segmentation
- In this paper, we proposed a new solution to the reconstruction of image in order to solve the oversegmentation problem of watershed transformation which is widely used as an ima...
Hyun Sil Sin, Hyun Woo Park, Hwang Kyu Yang, Tae S...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 8 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
HPCA
1995
IEEE
13 years 12 months ago
Access Ordering and Memory-Conscious Cache Utilization
As processor speeds increase relative to memory speeds, memory bandwidth is rapidly becoming the limiting performance factor for many applications. Several approaches to bridging ...
Sally A. McKee, William A. Wulf
COMCOM
1998
102views more  COMCOM 1998»
13 years 8 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
CVPR
2009
IEEE
1289views Computer Vision» more  CVPR 2009»
15 years 3 months ago
Bundling Features for Large Scale Partial-Duplicate Web Image Search
In state-of-the-art image retrieval systems, an image is represented by a bag of visual words obtained by quantizing high-dimensional local image descriptors, and scalable schem...
Zhong Wu (Tsinghua University), Qifa Ke (Microsoft...