Sciweavers

4985 search results - page 991 / 997
» Re-Configurable Computing in Wireless
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 1 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
14 years 1 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
CAISE
2006
Springer
14 years 1 months ago
A Personalized and Context-Aware Adaptation Process for Web-Based Groupware Systems
The evolution of mobile technologies, like web-enable cellphones, PDAs and wireless networks, makes it now possible to use these technologies for collaborative work through web-bas...
Manuele Kirsch-Pinheiro, Marlène Villanova-...
FSE
2004
Springer
125views Cryptology» more  FSE 2004»
14 years 1 months ago
New Security Proofs for the 3GPP Confidentiality and Integrity Algorithms
ded abstract of this paper appears in Fast Software Encryption, FSE 2004, Lecture Notes in Computer Science, W. Meier and B. Roy editors, Springer-Verlag, 2004. This is the full ve...
Tetsu Iwata, Tadayoshi Kohno
AAAI
2008
14 years 3 days ago
CIGAR: Concurrent and Interleaving Goal and Activity Recognition
In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recogni...
Derek Hao Hu, Qiang Yang