142 search results - page 7 / 29 » Computing Maximum-Scoring Segments in Almost Linear Time |
ISCAS
2007
IEEE
14 years 1 months ago
2007
IEEE
— Searching for an efficient summarization of multi-channel electroencephalogram (EEG) behavior is a challenging signal analysis problem. Recently, parallel factor analysis (PAR...
JMLR
2006
13 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
MVA
2010
13 years 5 months ago
2010
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
We introduce a fast, multiscale algorithm for image segmentation. Our algorithm uses modern numeric techniques to nd an approximate solution to normalized cut measures in time tha...