Sciweavers

1802 search results - page 278 / 361
» Sparse Computations with PEI
Sort
View
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 7 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
GC
2004
Springer
15 years 7 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
105
Voted
IPPS
2003
IEEE
15 years 7 months ago
Performance of Distributed Algorithms for Topology Control in Wireless Networks
We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoret...
Stefan Rührup, Christian Schindelhauer, Klaus...
DOCENG
2003
ACM
15 years 7 months ago
Lazy XSL transformations
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tr...
Steffen Schott, Markus L. Noga
111
Voted
ECCV
2010
Springer
15 years 6 months ago
Compressive Acquisition of Dynamic Scenes
Abstract. Compressive sensing (CS) is a new approach for the acquisition and recovery of sparse signals and images that enables sampling rates significantly below the classical Ny...