Sciweavers

1801 search results - page 237 / 361
» Pointing without a pointer
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 10 months ago
One shot schemes for decentralized quickest change detection
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
Olympia Hadjiliadis, Hongzhong Zhang, H. Vincent P...
CSL
2010
Springer
14 years 10 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
DM
2008
103views more  DM 2008»
14 years 10 months ago
A note on lattice chains and Delannoy numbers
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
John S. Caughman IV, Clifford R. Haithcock, J. J. ...
EJC
2008
14 years 10 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
BC
2006
132views more  BC 2006»
14 years 10 months ago
Local visual homing by matched-filter descent in image distances
Abstract In natural images, the distance measure between two images taken at different locations rises smoothly with increasing distance between the locations. This fact can be exp...
Ralf Möller, Andrew Vardy