Sciweavers

1435 search results - page 183 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
82
Voted
AAAI
2008
15 years 17 days ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
102
Voted
CORR
2012
Springer
230views Education» more  CORR 2012»
13 years 6 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
113
Voted
INFOCOM
2012
IEEE
13 years 21 days ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
85
Voted
SMA
2009
ACM
208views Solid Modeling» more  SMA 2009»
15 years 4 months ago
Accelerating geometric queries using the GPU
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...
Adarsh Krishnamurthy, Sara McMains, Kirk Haller
130
Voted
SIGCOMM
2005
ACM
15 years 3 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...