Sciweavers

3937 search results - page 399 / 788
» Questioning Ubiquitous Computing
Sort
View
ICALP
2003
Springer
15 years 11 months ago
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
Stefan Blom, Wan Fokkink, Sumit Nain
ICANN
2001
Springer
15 years 11 months ago
Product Unit Neural Networks with Constant Depth and Superlinear VC Dimension
Abstract. It has remained an open question whether there exist product unit networks with constant depth that have superlinear VC dimension. In this paper we give an answer by cons...
Michael Schmitt
124
Voted
COCO
1998
Springer
93views Algorithms» more  COCO 1998»
15 years 10 months ago
Resource Bounded Measure and Learnability
We consider the resource bounded measure of polynomial-time learnable subclasses of polynomial-size circuits. We show that if EXP 6= MA, then every PAClearnable subclass of P=poly...
Wolfgang Lindner, Rainer Schuler, Osamu Watanabe
ICALP
1992
Springer
15 years 10 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
EVOW
2009
Springer
15 years 10 months ago
Artificial Nature: Immersive World Making
Abstract. Artificial Nature is a trans-disciplinary research project drawing upon bio-inspired system theories in the production of engaging immersive worlds as art installations. ...
Graham Wakefield, Haru (Hyunkyung) Ji