Sciweavers

1192 search results - page 48 / 239
» Computing Weakest Readings
Sort
View
NCA
2008
IEEE
15 years 6 months ago
Supporting Linearizable Semantics in Replicated Databases
This paper proposes a novel database replication algorithm that offers strong consistency (linearizable semantics) and allows reads and non-conflicting writes to execute in para...
Luís Rodrigues, Nuno Carvalho, Emili Miedes
EWSN
2006
Springer
15 years 11 months ago
PAQ: Time Series Forecasting for Approximate Query Answering in Sensor Networks
In this paper, we present a method for approximating the values of sensors in a wireless sensor network based on time series forecasting. More specifically, our approach relies on ...
Daniela Tulone, Samuel Madden
FLAIRS
2007
15 years 2 months ago
Discriminating between Second Language Learning Text-Types
Text classification remains one of the major fields of research in natural language processing. This paper evaluates the use of the computational tool Coh-Metrix as a means to dis...
Scott A. Crossley, Philip M. McCarthy, Danielle S....
CHI
2008
ACM
16 years 7 days ago
Exploring the role of the reader in the activity of blogging
Within the last decade, blogs have become an important element of popular culture, mass media, and the daily lives of countless Internet users. Despite the medium's interacti...
Eric Baumer, Mark Sueyoshi, Bill Tomlinson
PDIS
1994
IEEE
15 years 4 months ago
Session Guarantees for Weakly Consistent Replicated Data
Four per-session guarantees are proposed to aid users and applications of weakly consistent replicated data: Read Your Writes, Monotonic Reads, Writes Follow Reads, and Monotonic ...
Douglas B. Terry, Alan J. Demers, Karin Petersen, ...