Sciweavers

2080 search results - page 269 / 416
» Measuring empirical computational complexity
Sort
View
ECCV
2002
Springer
16 years 8 months ago
A Probabilistic Theory of Occupancy and Emptiness
This paper studies the inference of 3D shape from a set of ? noisy photos. We derive a probabilistic framework to specify what one can infer about 3D shape for arbitrarily-shaped, ...
Rahul Bhotika, David J. Fleet, Kiriakos N. Kutulak...
ECCV
2000
Springer
16 years 8 months ago
On the Structure and Properties of the Quadrifocal Tensor
The quadrifocal tensor which connects image measurements along 4 views is not yet well understood as its counterparts the fundamental matrix and the trifocal tensor. This paper es...
Amnon Shashua, Lior Wolf
CHI
2008
ACM
16 years 6 months ago
Feasibility and pragmatics of classifying working memory load with an electroencephalograph
A reliable and unobtrusive measurement of working memory load could be used to evaluate the efficacy of interfaces and to provide real-time user-state information to adaptive syst...
David B. Grimes, Desney S. Tan, Scott E. Hudson, P...
FCT
2009
Springer
16 years 29 days ago
Directed Graphs of Entanglement Two
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
Erich Grädel, Lukasz Kaiser, Roman Rabinovich
ICPR
2008
IEEE
16 years 25 days ago
Grading nuclear pleomorphism on histological micrographs
A mainstay in cancer diagnostics is the classification or grading of cell nuclei based on their appearance. While the analysis of cytological samples has been automated successful...
Eric Cosatto, Matthew Miller, Hans Peter Graf, Joh...