Sciweavers

923 search results - page 70 / 185
» The Computational Structure of Progress Conditions
Sort
View
KAIS
2007
75views more  KAIS 2007»
14 years 9 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann
CALCO
2005
Springer
104views Mathematics» more  CALCO 2005»
15 years 3 months ago
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
Samson Abramsky
IJDAR
2006
103views more  IJDAR 2006»
14 years 9 months ago
Table-processing paradigms: a research survey
Tables are a ubiquitous form of communication. While everyone seems to know what a table is, a precise, analytical definition of "tabularity" remains elusive because some...
David W. Embley, Matthew Hurst, Daniel P. Lopresti...
TCSV
2008
202views more  TCSV 2008»
14 years 9 months ago
Probabilistic Object Tracking With Dynamic Attributed Relational Feature Graph
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...
Feng Tang, Hai Tao
CVPR
2005
IEEE
15 years 11 months ago
Learning Spatiotemporal T-Junctions for Occlusion Detection
The goal of motion segmentation and layer extraction can be viewed as the detection and localization of occluding surfaces. A feature that has been shown to be a particularly stro...
Nicholas Apostoloff, Andrew W. Fitzgibbon