Sciweavers

87 search results - page 5 / 18
» Dynamic Maximum Tree Depth
Sort
View
RTSS
2006
IEEE
14 years 3 months ago
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks
Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case...
Anis Koubaa, Mário Alves, Eduardo Tovar
NPAR
2004
ACM
14 years 3 months ago
Cartoon rendering of smoke animations
We describe a technique for generating cartoon style animations of smoke. Our method takes the output of a physically-based simulator and uses it to drive particles that are rende...
Andrew Selle, Alex Mohr, Stephen Chenney
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 11 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
JAIR
2011
187views more  JAIR 2011»
13 years 4 months ago
A Monte-Carlo AIXI Approximation
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
Joel Veness, Kee Siong Ng, Marcus Hutter, William ...
ATVA
2008
Springer
90views Hardware» more  ATVA 2008»
13 years 11 months ago
Tree Pattern Rewriting Systems
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...
Blaise Genest, Anca Muscholl, Olivier Serre, Marc ...