564 search results - page 88 / 113 » Some Results on the Expressive Power and Complexity of LSCs |
87
Voted
STACS
2010
Springer
15 years 4 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
100
click to vote
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
In this paper we develop a tractable framework for SINR analysis in downlink heterogeneous cellular networks (HCNs) with flexible cell association policies. The HCN is modeled as...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— The dangerous and time sensitive nature of a disaster area makes it an ideal application for robotic exploration. Our long term goal is to enable humans, software agents, and a...
VR
2002
IEEE
15 years 2 months ago
2002
IEEE
We present a novel class of virtual reality input devices that combine pop through buttons with 6 DOF trackers. Compared to similar devices that use conventional buttons, pop thro...