Sciweavers

1498 search results - page 132 / 300
» Collection tree protocol
Sort
View
ENDM
2010
101views more  ENDM 2010»
15 years 5 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
IVA
2010
Springer
15 years 3 months ago
How a Virtual Agent Should Smile? - Morphological and Dynamic Characteristics of Virtual Agent's Smiles
A smile may communicate different meanings depending on subtle characteristics of the facial expression. In this article, we have studied the morphological and dynamic characteris...
Magalie Ochs, Radoslaw Niewiadomski, Catherine Pel...
JACM
2010
208views more  JACM 2010»
15 years 3 months ago
The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...
David M. Blei, Thomas L. Griffiths, Michael I. Jor...
TACAS
2010
Springer
142views Algorithms» more  TACAS 2010»
16 years 2 days ago
Tracking Heaps That Hop with Heap-Hop
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
Jules Villard, Étienne Lozes, Cristiano Cal...
ICASSP
2008
IEEE
15 years 11 months ago
Separation of overlapping RFID signals by antenna arrays
— Radio Frequency Identi cation (RFID) is a technology to wirelessly transmit the identity of tagged objects. For long-range (UHF) systems with multiple tags, the tag replies may...
Asli F. Mindikoglu, Alle-Jan van der Veen