Sciweavers

868 search results - page 49 / 174
» A general compression algorithm that supports fast searching
Sort
View
MM
2010
ACM
199views Multimedia» more  MM 2010»
13 years 8 months ago
TOP-SURF: a visual words toolkit
TOP-SURF is an image descriptor that combines interest points with visual words, resulting in a high performance yet compact descriptor that is designed with a wide range of conte...
Bart Thomee, Erwin M. Bakker, Michael S. Lew
LATIN
1998
Springer
13 years 12 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro
SPAA
2005
ACM
14 years 1 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
ACMSE
2006
ACM
14 years 1 months ago
Support vector machines for collaborative filtering
Support Vector Machines (SVMs) have successfully shown efficiencies in many areas such as text categorization. Although recommendation systems share many similarities with text ca...
Zhonghang Xia, Yulin Dong, Guangming Xing
DAC
2005
ACM
13 years 9 months ago
Partitioning-based approach to fast on-chip decap budgeting and minimization
This paper proposes a fast decoupling capacitance (decap) allocation and budgeting algorithm for both early stage decap estimation and later stage decap minimization in today’s ...
Hang Li, Zhenyu Qi, Sheldon X.-D. Tan, Lifeng Wu, ...