1000 search results - page 172 / 200 » Dependency Tree Automata |
EUROPAR
2007
Springer
14 years 4 months ago
2007
Springer
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
ACSC
2006
IEEE
14 years 4 months ago
2006
IEEE
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
3DIM
2005
IEEE
14 years 4 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
IDEAS
2005
IEEE
14 years 4 months ago
2005
IEEE
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
CIKM
2005
Springer
14 years 4 months ago
2005
Springer
Our previous work on road detection suggests the usage of prior knowledge in order to improve performance. In this paper we will explain our motivation for a novel approach, defin...