Sciweavers

1810 search results - page 311 / 362
» Type Systems for Distributed Data Structures
Sort
View
ICDCS
1995
IEEE
13 years 11 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere
AIPR
2002
IEEE
14 years 19 days ago
Hyperspectral Imaging of Kaposi's Sarcoma for Disease Assessment and Treatment Monitoring
Light spectroscopic methods are critical to advances in molecular characterization of disease processes. However, these methods have been limited to in-vitro or cell culture studi...
David Hattery, Moinuddin Hassan, Stavros Demos, Am...
OOPSLA
2005
Springer
14 years 1 months ago
X10: an object-oriented approach to non-uniform cluster computing
It is now well established that the device scaling predicted by Moore’s Law is no longer a viable option for increasing the clock frequency of future uniprocessor systems at the...
Philippe Charles, Christian Grothoff, Vijay A. Sar...
SENSYS
2005
ACM
14 years 1 months ago
TSAR: a two tier sensor storage architecture using interval skip graphs
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
Peter Desnoyers, Deepak Ganesan, Prashant J. Sheno...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 8 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan