4850 search results - page 745 / 970 » Approximate Data Structures with Applications |
135
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
This paper introduces a tracking method for the well known local MSER (Maximally Stable Extremal Region) detector. The component tree is used as an efficient data structure, which...
139
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
142
Voted
ISBI
2008
IEEE
16 years 5 months ago
2008
IEEE
Most clustering algorithms in fMRI analysis implicitly require some nontrivial assumption on data structure. Due to arbitrary distribution of fMRI time series in the temporal doma...
140
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
154
click to vote
KDD
2001
ACM
16 years 5 months ago
2001
ACM
Web Usage Mining refers to the discovery of interesting information from user navigational behavior as stored in web access logs. While extracting simple information from web logs...