Sciweavers

10054 search results - page 1830 / 2011
» On the Complexity of Function Learning
Sort
View
180
Voted
ICDCS
2012
IEEE
13 years 6 months ago
Scalable Name Lookup in NDN Using Effective Name Component Encoding
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junche...
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
15 years 10 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
CVPR
2009
IEEE
2115views Computer Vision» more  CVPR 2009»
16 years 11 months ago
Real-Time O(1) Bilateral Filtering
We propose a new bilateral filtering algorithm with computational complexity invariant to filter kernel size, socalled O(1) or constant time in the literature. By showing that a...
Kar-Han Tan, Narendra Ahuja, Qingxiong Yang
CVPR
2006
IEEE
16 years 6 months ago
SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...
Alexander C. Berg, Hao Zhang 0003, Jitendra Malik,...
ICIP
2007
IEEE
16 years 5 months ago
A Statistical Approach for Intensity Loss Compensation of Confocal Microscopy Images
In this paper a probabilistic technique for compensation of intensity loss in the confocal microscopy images is presented. Confocal microscopy images are modeled as a mixture of t...
Sowmya Gopinath, Ninad Thakoor, Jean Gao, Kate Lub...
« Prev « First page 1830 / 2011 Last » Next »