Sciweavers

3204 search results - page 207 / 641
» The b-chromatic Number of a Graph
Sort
View
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
14 years 4 months ago
Hierarchical Map Building and Planning based on Graph Partitioning
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Zoran Zivkovic, Bram Bakker, Ben J. A. Kröse
SCIA
2005
Springer
158views Image Analysis» more  SCIA 2005»
14 years 4 months ago
A Graph Representation of Filter Networks
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...
Björn Svensson, Mats T. Andersson, Hans Knuts...
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
14 years 4 months ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
PCM
2004
Springer
107views Multimedia» more  PCM 2004»
14 years 4 months ago
Complete Performance Graphs in Probabilistic Information Retrieval
The performance of a Content-Based Image Retrieval (CBIR) system presented in the form of Precision-Recall or PrecisionScope graphs offers an incomplete overview of the system und...
Nicu Sebe, Dionysius P. Huijsmans, Qi Tian, Theo G...
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
14 years 4 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava