Sciweavers

324 search results - page 24 / 65
» Distance Approximating Trees: Complexity and Algorithms
Sort
View
TOG
2012
222views Communications» more  TOG 2012»
11 years 9 months 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...
GLOBECOM
2008
IEEE
14 years 1 months ago
Impact of Constraints on the Complexity of Dynamic Spectrum Assignment
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
Chetan Nanjunda Mathur, Mohamed A. Haleem, Rajarat...
ROBOCUP
2004
Springer
111views Robotics» more  ROBOCUP 2004»
14 years 22 days ago
Realtime Object Recognition Using Decision Tree Learning
Abstract. An object recognition process in general is designed as a domain specific, highly specialized task. As the complexity of such a process tends to be rather inestimable, m...
Dirk Wilking, Thomas Röfer
ADC
2008
Springer
141views Database» more  ADC 2008»
14 years 1 months ago
Approximate Retrieval of XML Data with ApproXPath
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
Lin Xu, Curtis E. Dyreson
SODA
2003
ACM
142views Algorithms» more  SODA 2003»
13 years 8 months ago
The similarity metric
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...