Sciweavers

DIALM
2007
ACM
131views Algorithms» more  DIALM 2007»
14 years 1 months ago
Dessy: Towards Flexible Mobile Desktop Search
In the near future, mobile devices are expected to have a storage capacity comparable to today's desktop machines. As the amount of infomation grows, conventional search tool...
Eemil Lagerspetz, Tancred Lindholm, Sasu Tarkoma
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
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
14 years 1 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
DIALM
2007
ACM
110views Algorithms» more  DIALM 2007»
14 years 1 months ago
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, ...
WWIC
2010
Springer
278views Communications» more  WWIC 2010»
14 years 1 months ago
Anomaly-Based Intrusion Detection Algorithms for Wireless Networks
Abstract. In this paper we present and evaluate anomaly-based intrusion detection algorithms for detecting physical layer jamming attacks in wireless networks, by seeking changes i...
Alexandros G. Fragkiadakis, Vasilios A. Siris, Nik...
DAARC
2007
Springer
97views Algorithms» more  DAARC 2007»
14 years 1 months ago
Null Subjects Are Reflexives, Not Pronouns
Abstract. It has been a prevalent assumption in the literature that phonetically null Subjects of finite clauses are pronouns. This paper examines in detail this empirical generali...
António Horta Branco
SWAT
2010
Springer
332views Algorithms» more  SWAT 2010»
14 years 1 months ago
Improved Methods For Generating Quasi-gray Codes
Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Mahe...
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 1 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
COMPGEOM
2007
ACM
14 years 1 months ago
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
Balint Miklos, Joachim Giesen, Mark Pauly
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
14 years 1 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola