Sciweavers

4913 search results - page 929 / 983
» Results and Perspectives of the G
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 4 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
89
Voted
HPDC
1997
IEEE
15 years 4 months ago
A Secure Communications Infrastructure for High-Performance Distributed Computing
We describe a software infrastructure designed to support the development of applications that use high-speed networks to connect geographically distributed supercomputers, databa...
Ian T. Foster, Nicholas T. Karonis, Carl Kesselman...
100
Voted
ICNP
1997
IEEE
15 years 4 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda
RTAS
1997
IEEE
15 years 4 months ago
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control
ÐReal-time middleware services must guarantee predictable performance under specified load and failure conditions, and ensure graceful degradation when these conditions are violat...
Tarek F. Abdelzaher, Ella M. Atkins, Kang G. Shin
SIGCOMM
1996
ACM
15 years 4 months ago
Removal Policies in Network Caches for World-Wide Web Documents
World-Wide Web proxy servers that cache documents can potentially reduce three quantities: the number of requests that reach popular servers, the volume of network trac resulting ...
Marc Abrams, Charles R. Standridge, Ghaleb Abdulla...