Sciweavers

861 search results - page 120 / 173
» Faster integer multiplication
Sort
View
TPDS
2010
118views more  TPDS 2010»
13 years 7 months ago
Using Parallel Bloom Filters for Multiattribute Representation on Network Services
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...
Bin Xiao, Yu Hua
ICCV
2011
IEEE
12 years 9 months ago
N-best maximal decoders for part models
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
Dennis Park, Deva Ramanan
KDD
2007
ACM
179views Data Mining» more  KDD 2007»
14 years 3 months ago
Mining statistically important equivalence classes and delta-discriminative emerging patterns
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
Jinyan Li, Guimei Liu, Limsoon Wong
ICRA
2006
IEEE
132views Robotics» more  ICRA 2006»
14 years 3 months ago
Speeding-up Multi-robot Exploration by Considering Semantic Place Information
— In this paper, we consider the problem of exploring an unknown environment with a team of mobile robots. One of the key issues in multi-robot exploration is how to assign targe...
Cyrill Stachniss, Óscar Martínez Moz...
CLUSTER
2005
IEEE
14 years 2 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman