31387 search results - page 6032 / 6278 » Abstracting abstract machines |
137
click to vote
SODA
1994
ACM
15 years 8 months ago
1994
ACM
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
189
click to vote
USENIX
1994
15 years 8 months ago
1994
y-filled data block results in a delayed write,Abstract while a modification that fills a block results in an immediate, although asynchronous, write. TheSome file systems can dela...
163
click to vote
IJCAI
1989
15 years 8 months ago
1989
t ion which is much more abstract than a place vocabulary, the kinematic topology. Kinematic topology does not define qualitative inference rules, but provides a characterization o...
190
click to vote
IJCAI
1989
15 years 8 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
221
click to vote
IJCAI
1989
15 years 8 months ago
1989
entional user behavior, we need a principled mannerAbstract for relaxing contextual constraints when they are violated.When computer speech recognition is used for problem In order...