Sciweavers

10997 search results - page 139 / 2200
» On the Structure of Complete Sets
Sort
View
CONCUR
1994
Springer
15 years 10 months ago
Weak Sequential Composition in Process Algebras
Abstract. In this paper we study a special operator for sequential composition, which is de ned relative to a dependency relation over the actions of a given system. The idea is th...
Arend Rensink, Heike Wehrheim
DSN
2007
IEEE
15 years 10 months ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
Jay J. Wylie, Ram Swaminathan
IR
2008
15 years 6 months ago
Output-sensitive autocompletion search
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
Holger Bast, Christian Worm Mortensen, Ingmar Webe...
JASIS
2007
101views more  JASIS 2007»
15 years 6 months ago
Mining Web functional dependencies for flexible information access
We present an approach to enhancing information access through web structure mining in contrast to traditional approaches involving usage mining. Specifically, we mine the hardwi...
Saverio Perugini, Naren Ramakrishnan
TSP
2008
151views more  TSP 2008»
15 years 6 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...