Sciweavers

737 search results - page 144 / 148
» Computer science projects with music
Sort
View
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
14 years 1 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
HOTOS
1993
IEEE
14 years 28 days ago
Object Groups May Be Better Than Pages
I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or ...
Mark Day
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
14 years 25 days ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
OOPSLA
1995
Springer
14 years 10 days ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....
CRYPTO
1987
Springer
87views Cryptology» more  CRYPTO 1987»
14 years 8 days ago
How to Make Replicated Data Secure
Many distributed systems manage some form of long-lived data, such as files or data bases. The performance and fault-tolerance of such systems may be enhanced if the repositories ...
Maurice Herlihy, J. D. Tygar