Sciweavers

3303 search results - page 448 / 661
» Multidimensional Access Methods
Sort
View
MOBICOM
1997
ACM
15 years 10 months ago
Composable ad-hoc Mobile Services for Universal Interaction
This paperintroduces the notion of “universalinteraction,” allowing a device to adapt its functionality to exploit services it discovers as it moves into a new environment. Us...
Todd D. Hodes, Randy H. Katz, Edouard Servan-Schre...
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 10 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
AIME
2007
Springer
15 years 10 months ago
An Experiment in Automatic Classification of Pathological Reports
Abstract. Medical reports are predominantly written in natural language; as such they are not computer-accessible. A common way to make medical narrative accessible to automated sy...
Janneke van der Zwaan, Erik F. Tjong Kim Sang, Maa...
CIKM
2009
Springer
15 years 10 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
ECOOP
2007
Springer
15 years 10 months ago
Validity Invariants and Effects
Object invariants describe the consistency of object states, and are crucial for reasoning about the correctness of object-oriented programs. However, reasoning about object invari...
Yi Lu 0003, John Potter, Jingling Xue