Result 1 to 20 of 77 total
LiMoSense ‒ live monitoring in dynamic sensor networks. (English)
Erlebach, Thomas (ed.) et al., Algorithms for sensor systems. 7th international symposium on algorithms for sensor systems, wireless ad hoc networks and autonomous mobile entities, ALGOSENSORS 2011, Saarbrücken, Germany, September 8‒9, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28208-9/pbk). Lecture Notes in Computer Science 7111, 72-85 (2012).
1
Distributed data clustering in sensor networks. (English)
Distrib. Comput. 24, No. 5, 207-222 (2011).
2
Distributed data classification in sensor networks (English)
PODC, 151-160 (2010).
3
Analysis of performance trade-offs for an adaptive channel-aware wireless scheduler. (English)
Wirel. Netw. 15, No. 7, 931-943 (2009).
4
Average case analysis of bounded space bin packing algorithms. (English)
Algorithmica 50, No. 1, 72-97 (2008).
5
There are not too many magic configurations (English)
Discrete & Computational Geometry 39, No. 1-3, 3-16 (2008).
6
Adaptive cardiac resynchronization therapy device based on spiking neurons architecture and reinforcement learning scheme (English)
IEEE Transactions on Neural Networks 18, No. 2, 542-550 (2007).
7
There are not too many magic configurations (English)
Symposium on Computational Geometry, 142-149 (2007).
8
On empty convex polygons in a planar point set (English)
J. Comb. Theory, Ser. A 113, No. 3, 385-419 (2006).
9
Deleting files in the celeste peer-to-peer storage system (English)
SRDS, 29-38 (2006).
10
Crossing patterns of semi-algebraic sets (English)
J. Comb. Theory, Ser. A 111, No. 2, 310-326 (2005).
11
Maintaining object ordering in a shared P2P storage environment (English)
IEEE Security in Storage Workshop, 52-62 (2005).
12
Stochastic analysis and performance evaluation of wireless schedulers. (English)
Wireless Commun. Mob. Comput. 4, No. 1, 19-41 (2004).
13
Topological graphs with no self-intersecting cycle of length 4. (English)
Pach, János (ed.), Towards a theory of geometric graphs. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3484-3/pbk). Contemporary Mathematics 342, 233-243 (2004).
14
On empty convex polygons in a planar point set (English)
Symposium on Computational Geometry, 391-400 (2004).
15
Topological graphs with no self-intersecting cycle of lenth 4 (English)
Symposium on Computational Geometry, 98-103 (2003).
16
Application-aware admission control and scheduling in web servers (English)
INFOCOM (2002).
17
Packet scheduling with fragmentation (English)
INFOCOM (2002).
18
Scheduling constant bit rate flows in data over cable networks (English)
ISCC, 577-582 (2002).
19
Bin packing with item fragmentation. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 7th international workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2125, 313-324 (2001).
20
Result 1 to 20 of 77 total
Start
Contact
Print
General Help
