4110 search results - page 734 / 822 » Efficient algorithms for the 2-gathering problem |
140
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
A fast algorithm, Accelerated Kernel Feature Analysis (AKFA), that discovers salient features evidenced in a sample of n unclassified patterns, is presented. Like earlier kernel-b...
145
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
We propose Markov chain Monte Carlo sampling methods to address uncertainty estimation in disparity computation. We consider this problem at a postprocessing stage, i.e. once the d...
165
click to vote
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
The work presents the first effort to automatically annotate the semantic meanings of temporal video patterns obtained through unsupervised discovery processes. This problem is in...
261
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
107
click to vote
ESORICS
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...