Sciweavers

8512 search results - page 141 / 1703
» Computing Theory With Relevance
Sort
View
CONCUR
2006
Springer
14 years 1 days ago
Probabilistic I/O Automata: Theories of Two Equivalences
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatizatio...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
COMGEO
2002
ACM
13 years 8 months ago
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited
The goals of this paper are twofold. The first is to present a new sampling theory for curves, based on a new notion of local feature size. The properties of this new feature size...
Daniel Freedman
JSC
2011
71views more  JSC 2011»
13 years 3 months ago
Chern numbers of smooth varieties via homotopy continuation and intersection theory
Homotopy continuation provides a numerical tool for computing the equivalence of a smooth variety in an intersection product. Intersection theory provides a theoretical tool for re...
Sandra Di Rocco, David Eklund, Chris Peterson, And...
CORR
2007
Springer
111views Education» more  CORR 2007»
13 years 8 months ago
Hypocomputation
Most research into hypercomputation focuses only on machines able to prove stronger results the basic Turing Machine, hence the phrase hypercomputation. However, developing hyperco...
David Love
FSEN
2009
Springer
14 years 2 months ago
Equational Reasoning on Ad Hoc Networks
We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize...
Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar