Sciweavers

1278 search results - page 165 / 256
» The Complexity of Weighted Boolean
Sort
View
ICDE
2000
IEEE
174views Database» more  ICDE 2000»
14 years 12 months ago
Self-Adaptive User Profiles for Large-Scale Data Delivery
Push-based data delivery requires knowledge of user interests for making scheduling, bandwidthallocation, and routing decisions. Such information is maintained as user profiles. W...
C. Lee Giles, Michael J. Franklin, Ugur Çet...
SOFSEM
2007
Springer
14 years 4 months ago
Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems
Abstract. The increasing complexity of today’s embedded systems applications imposes the requirements and constraints of distributed, heterogeneous subsystem interaction to softw...
Dietmar Schreiner, Karl M. Göschka
GLOBECOM
2006
IEEE
14 years 4 months ago
Optimized Transmission for Upstream Vectored DSL Systems Using Zero-Forcing Generalized Decision-Feedback Equalizers
— In upstream vectored DSL transmission, the far-end crosstalk (FEXT) can be completely cancelled by using zeroforcing generalized decision-feedback equalizers (ZF-GDFE). When th...
Chiang-Yu Chen, Kibeom Seong, Rui Zhang, John M. C...
COMPGEOM
2010
ACM
14 years 3 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
FSE
1993
Springer
89views Cryptology» more  FSE 1993»
14 years 2 months ago
Parallel FFT-Hashing
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
Claus-Peter Schnorr, Serge Vaudenay