Sciweavers

INFOCOM
2012
IEEE
12 years 3 months ago
Delay optimal multichannel opportunistic access
Abstract—The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing a...
Shiyao Chen, Lang Tong, Qing Zhao
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 20 days ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
DAGSTUHL
2007
14 years 2 months ago
Diagonal Circuit Identity Testing and Lower Bounds
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
Nitin Saxena
LOPSTR
2004
Springer
14 years 6 months ago
On Termination of Binary CLP Programs
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
Alexander Serebrenik, Frédéric Mesna...
EUROGP
2005
Springer
14 years 6 months ago
Understanding Evolved Genetic Programs for a Real World Object Detection Problem
We describe an approach to understanding evolved programs for a real world object detection problem, that of finding orthodontic landmarks in cranio-facial X-Rays. The approach in...
Victor Ciesielski, Andrew Innes, Sabu John, John M...