Sciweavers

1064 search results - page 90 / 213
» Single Tree Grammars
Sort
View
128
Voted
MST
2000
86views more  MST 2000»
15 years 3 months ago
Team Learning of Computable Languages
A team of learning machines is a multiset of learning machines. A team is said to successfully learn a concept just in case each member of some nonempty subset, of predetermined s...
Sanjay Jain, Arun Sharma
155
Voted
FOCS
1996
IEEE
15 years 7 months ago
Fault Tolerant Data Structures
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. ...
Yonatan Aumann, Michael A. Bender
107
Voted
CPE
1997
Springer
79views Hardware» more  CPE 1997»
15 years 7 months ago
Storage Alternatives for Large Structured State Spaces
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
Gianfranco Ciardo, Andrew S. Miner
139
Voted
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
15 years 9 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
MM
1996
ACM
128views Multimedia» more  MM 1996»
15 years 7 months ago
The Case for Reliable Concurrent Multicasting Using Shared Ack Trees
Such interactive, distributed multimedia applications as shared whiteboards, group editors, and simulations require reliable concurrent multicast services, i.e., the reliable diss...
Brian Neil Levine, David B. Lavo, J. J. Garcia-Lun...