Sciweavers

198 search results - page 9 / 40
» Dynamic spatial approximation trees
Sort
View
ICPR
2004
IEEE
14 years 11 months ago
Detection of Artificial Structures in Natural-Scene Images Using Dynamic Trees
We seek a framework that addresses localization, detection and recognition of man-made objects in natural-scene images in a unified manner. We propose to model artificial structur...
Michael C. Nechyba, Sinisa Todorovic
ICALP
2005
Springer
14 years 3 months ago
Spatial Logics for Bigraphs
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...
COMCOM
2010
276views more  COMCOM 2010»
13 years 10 months ago
Adjustable convergecast tree protocol for wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
TOG
2012
222views Communications» more  TOG 2012»
12 years 8 days ago
Plastic trees: interactive self-adapting botanical tree models
We present a dynamic tree modeling and representation technique that allows complex tree models to interact with their environment. Our method uses changes in the light distributi...
Sören Pirk, Ondrej Stava, Julian Kratt, Miche...
EOR
2007
117views more  EOR 2007»
13 years 9 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...