Sciweavers

113 search results - page 18 / 23
» When can a graph form an orthogonal polyhedron
Sort
View
OSDI
2004
ACM
14 years 7 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
14 years 21 days ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
AAAI
1996
13 years 8 months ago
Robot Navigation Using Image Sequences
We describe a framework for robot navigation that exploits the continuity of image sequences. Tracked visual features both guide the robot and provide predictive information about...
Christopher Rasmussen, Gregory D. Hager
PVLDB
2011
13 years 2 months ago
Personalized Social Recommendations - Accurate or Private?
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
Ashwin Machanavajjhala, Aleksandra Korolova, Atish...
TMC
2010
115views more  TMC 2010»
13 years 5 months ago
Controlled Wi-Fi Sharing in Cities: A Decentralized Approach Relying on Indirect Reciprocity
—In densely populated cities, Wi-Fi networks—private or otherwise—are ubiquitous. We focus on the provision of citywide broadband communication capability to mobile users thr...
Elias C. Efstathiou, Pantelis A. Frangoudis, Georg...