Sciweavers

462 search results - page 77 / 93
» Covering a Tree by a Forest
Sort
View
IJRR
2010
132views more  IJRR 2010»
13 years 4 months ago
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 2 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
FTDB
2011
98views more  FTDB 2011»
12 years 11 months ago
Secure Distributed Data Aggregation
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
Haowen Chan, Hsu-Chun Hsiao, Adrian Perrig, Dawn S...
CVPR
2006
IEEE
14 years 9 months ago
The Layout Consistent Random Field for Recognizing and Segmenting Partially Occluded Objects
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
John M. Winn, Jamie Shotton
CADE
2008
Springer
14 years 7 months ago
Proving Group Protocols Secure Against Eavesdroppers
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen