Sciweavers

1342 search results - page 220 / 269
» Descriptor Learning for Efficient Retrieval
Sort
View
KDD
2009
ACM
379views Data Mining» more  KDD 2009»
14 years 1 months ago
MetaFac: community discovery via relational hypergraph factorization
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 1 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
CIKM
2006
Springer
14 years 17 days ago
Multi-evidence, multi-criteria, lazy associative document classification
We present a novel approach for classifying documents that combines different pieces of evidence (e.g., textual features of documents, links, and citations) transparently, through...
Adriano Veloso, Wagner Meira Jr., Marco Cristo, Ma...
CIKM
2008
Springer
13 years 10 months ago
Large-scale, parallel automatic patent annotation
When researching new product ideas or filing new patents, inventors need to retrieve all relevant pre-existing know-how and/or to exploit and enforce patents in their technologica...
Milan Agatonovic, Niraj Aswani, Kalina Bontcheva, ...
SIGIR
2010
ACM
13 years 9 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano