Sciweavers

3946 search results - page 70 / 790
» The computational complexity of choice sets
Sort
View
COGSCI
2010
160views more  COGSCI 2010»
14 years 12 months ago
Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
Jakub Szymanik, Marcin Zajenkowski
CONCUR
2008
Springer
15 years 1 months ago
Distributed Timed Automata with Independently Evolving Clocks
Abstract. We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of th...
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan ...
ICCV
2005
IEEE
16 years 1 months ago
The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
Kristen Grauman, Trevor Darrell
FOCS
1999
IEEE
15 years 4 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
ECCV
2004
Springer
16 years 1 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla