Sciweavers

898 search results - page 10 / 180
» A Linear Tabling Mechanism
Sort
View
CHI
2004
ACM
14 years 8 months ago
Release, relocate, reorient, resize: fluid techniques for document sharing on multi-user interactive tables
Group work frequently involves transitions between periods of active collaboration and periods of individual activity. We aim to support this typical work practice by introducing ...
Chia Shen, Clifton Forlines, Frédéri...
SSS
2009
Springer
144views Control Systems» more  SSS 2009»
14 years 2 months ago
Churn-Resilient Replication Strategy for Peer-to-Peer Distributed Hash-Tables
Abstract. DHT-based P2P systems provide a fault-tolerant and scalable mean to store data blocks in a fully distributed way. Unfortunately, recent studies have shown that if connect...
Sergey Legtchenko, Sébastien Monnet, Pierre...
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 7 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos
COCOON
2009
Springer
14 years 2 months ago
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
Ivona Bezáková, Nayantara Bhatnagar,...
ISCC
2006
IEEE
104views Communications» more  ISCC 2006»
14 years 1 months ago
Stable High-Capacity One-Hop Distributed Hash Tables
Most research on Distributed Hash Tables (DHTs) assumes ephemeral, lightly loaded deployments. Each node has a lifetime of a few hours and initiates a lookup once every few second...
John Risson, Aaron Harwood, Tim Moors