Sciweavers

950 search results - page 130 / 190
» Type Specialization in Aldor
Sort
View
DIS
1998
Springer
14 years 29 days ago
Uniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara...
IPPS
1997
IEEE
14 years 29 days ago
Interoperability of Data Parallel Runtime Libraries
This paper describes a framework for providing the ability to use multiple specialized data parallel libraries and/or languages within a single application. The ability to use mul...
Guy Edjlali, Alan Sussman, Joel H. Saltz
CHI
1997
ACM
14 years 28 days ago
WorldBeat: Designing a Baton-Based Interface for an Interactive Music Exhibit
This paper presents the interface design of the WorldBeat system, an interactive exhibit about using computers in musical education, and as musical instruments. The system allows ...
Jan O. Borchers
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
14 years 27 days ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
INFOCOM
1992
IEEE
14 years 25 days ago
An Assessment of State and Lookup Overhead in Routers
The current Internet is based on a stateless (datagram) architecture. However, many recent proposals rely on the maintenance of state information within network routers, leading t...
Deborah Estrin, Danny J. Mitzel