Sciweavers

4066 search results - page 123 / 814
» Almost Complete Sets
Sort
View
CVPR
2010
IEEE
15 years 8 months ago
Proximate Sensing: Inferring What-Is-Where From Georeferenced Photo Collections
The primary and novel contribution of this work is the conjecture that large collections of georeferenced photo collections can be used to derive maps of what-is-where on the surf...
Daniel Leung, Shawn Newsam
CSL
2008
Springer
15 years 8 months ago
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Ian Hodkinson, Angelo Montanari, Guido Sciavicco
DAGM
2008
Springer
15 years 8 months ago
Segmentation of SBFSEM Volume Data of Neural Tissue by Hierarchical Classification
Three-dimensional electron-microscopic image stacks with almost isotropic resolution allow, for the first time, to determine the complete connection matrix of parts of the brain. I...
Björn Andres, Ullrich Köthe, Moritz Helm...
AAAI
2010
15 years 7 months ago
A Restriction of Extended Resolution for Clause Learning SAT Solvers
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
Gilles Audemard, George Katsirelos, Laurent Simon
CORR
2006
Springer
83views Education» more  CORR 2006»
15 years 6 months ago
How to Beat the Adaptive Multi-Armed Bandit
The multi-armed bandit is a concise model for the problem of iterated decision-making under uncertainty. In each round, a gambler must pull one of K arms of a slot machine, withou...
Varsha Dani, Thomas P. Hayes