5128 search results - page 1003 / 1026 » When Abstraction Fails |
CORR
1999
Springer
14 years 11 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
121
click to vote
DC
1999
14 years 11 months ago
1999
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
JCNS
1998
14 years 11 months ago
1998
Abstract. We study some mechanisms responsible for synchronous oscillations and loss of synchrony at physiologically relevant frequencies 10-200 Hz in a network of heterogeneous ...
JSYML
1998
14 years 11 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
103
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...