Sciweavers

91 search results - page 5 / 19
» Finding an Optimal Path without Growing the Tree
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Finding the splitting vector for image resolution up-conversion
This paper proposes a new single-frame image upconversion approach that uses prior information. The proposed method overcomes the drawbacks of the Kondo 2001 where the class membe...
Xinyu Xu, Hao Pan
CF
2006
ACM
13 years 9 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 7 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
AAAI
2010
13 years 9 months ago
Search-Based Path Planning with Homotopy Class Constraints
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
Subhrajit Bhattacharya
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma