16430 search results - page 148 / 3286 » On Computable Tree Functions |
134
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
148
Voted
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
114
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
112
Voted
IRI
2008
IEEE
15 years 10 months ago
2008
IEEE
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
127
Voted
ESANN
2006
15 years 5 months ago
2006
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...