Sciweavers

3360 search results - page 268 / 672
» Opportunistic Data Structures with Applications
Sort
View
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
16 years 6 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
15 years 11 months ago
A Generalization of Forward-Backward Algorithm
Structured prediction has become very important in recent years. A simple but notable class of structured prediction is one for sequences, so-called sequential labeling. For sequen...
Ai Azuma, Yuji Matsumoto
MLDM
1999
Springer
15 years 9 months ago
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
Irwin King, Tak-Kan Lau
VLSISP
2011
223views Database» more  VLSISP 2011»
14 years 11 months ago
Wideband Beamspace Processing Using Orthogonal Modal Beamformers
We introduce a novel beamspace processing structure that can be used for narrowband or wideband sources located either in nearfield or farfield of a sensor array. Main features o...
Thushara D. Abhayapala, Darren B. Ward
WWW
2011
ACM
14 years 11 months ago
HyLiEn: a hybrid approach to general list extraction on the web
We consider the problem of automatically extracting general lists from the web. Existing approaches are mostly dependent upon either the underlying HTML markup or the visual struc...
Fabio Fumarola, Tim Weninger, Rick Barber, Donato ...