Sciweavers

3961 search results - page 303 / 793
» Algorithmic Statistics
Sort
View
CVPR
2009
IEEE
17 years 2 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ICPR
2002
IEEE
16 years 8 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 10 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
PAMI
2008
206views more  PAMI 2008»
15 years 7 months ago
Robust Real-Time Unusual Event Detection using Multiple Fixed-Location Monitors
We present a novel algorithm for detection of certain types of unusual events. The algorithm is based on multiple local monitors which collect low-level statistics. Each local moni...
Amit Adam, Ehud Rivlin, Ilan Shimshoni, David Rein...
LREC
2008
106views Education» more  LREC 2008»
15 years 8 months ago
Inter-sentential Coreferences in Semantic Networks: An Evaluation of Manual Annotation
We present an evaluation of inter-sentential coreference annotation in the context of manually created semantic networks. The semantic networks are constructed independently be ea...
Václav Novák, Keith Hall