Sciweavers

3146 search results - page 588 / 630
» Efficient Consequence Finding
Sort
View
ICCCN
1998
IEEE
13 years 12 months ago
Fast Recovery Protocol for Database and Link Failures in Mobile Networks
An important issue in the design of future Personal Communication Services (PCS) networks is the efficient management of location information. The current IS-41 standard P C S arc...
Govind Krishnamurthi, Stefano Chessa, Arun K. Soma...
RTSS
1998
IEEE
13 years 12 months ago
Practical Solutions for QoS-Based Resource Allocation
Abstract: The QoS-based Resource Allocation Model (QRAM) proposed in [20] presented an analytical approach for satisfying multiple quality-of-service dimensions in a resource-const...
Ragunathan Rajkumar, Chen Lee, John P. Lehoczky, D...
SRDS
1998
IEEE
13 years 12 months ago
A Data Allocation Algorithm for Distributed Hypermedia Documents
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different site...
Siu-Kai So, Ishfaq Ahmad, Kamalakar Karlapalem
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
13 years 12 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
SPAA
1997
ACM
13 years 12 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas