Sciweavers

6251 search results - page 434 / 1251
» Randomness, Computability, and Density
Sort
View
ICPR
2004
IEEE
16 years 8 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
ECSCW
2003
15 years 8 months ago
Supporting Collaboration Ubiquitously: An Augmented Learning Environment for Architecture Students
While CSCW research has mostly been focusing on desktop applications there is a growing interest on ubiquitous and tangible computing. We present ethnographic fieldwork and prototy...
Giulio Iacucci, Ina Wagner
CORR
2011
Springer
161views Education» more  CORR 2011»
15 years 1 months ago
The physical Church-Turing thesis and the principles of quantum theory
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
Pablo Arrighi, Gilles Dowek
ICCV
2011
IEEE
14 years 6 months ago
Object Segmentation in Video: A Hierarchical Variational Approach for Turning Point Trajectories into Dense Regions
Point trajectories have emerged as a powerful means to obtain high quality and fully unsupervised segmentation of objects in video shots. They can exploit the long term motion dif...
Peter Ochs, Thomas Brox
CIE
2005
Springer
16 years 12 days ago
Schnorr Dimension
Following Lutz’s approach to effective (constructive) dimension, we define a notion of dimension for individual sequences based on Schnorr’s concept(s) of randomness. In contr...
Rodney G. Downey, Wolfgang Merkle, Jan Reimann