Sciweavers

417 search results - page 32 / 84
» Constructing Call Multigraphs Using Dependence Graphs
Sort
View
CVPR
2006
IEEE
16 years 1 months ago
Graph Laplacian Kernels for Object Classification from a Single Example
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...
Hong Chang, Dit-Yan Yeung
ICEIS
2010
IEEE
14 years 9 months ago
Graph-based Knowledge Representation and Reasoning
This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphi...
M. Chein
CC
2007
Springer
208views System Software» more  CC 2007»
15 years 6 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
IJCAI
1997
15 years 1 months ago
Machine Learning Techniques to Make Computers Easier to Use
Identifying user-dependent information that can be automatically collected helps build a user model by which 1) to predict what the user wants to do next and 2) to do relevant pre...
Hiroshi Motoda, Kenichi Yoshida
92
Voted
ICIP
2010
IEEE
14 years 9 months ago
Towards unifying diffusion and exemplar-based inpainting
A novel framework for image inpainting is proposed, relying on graph-based diffusion processes. Depending on the construction of the graph, both flow-based and exemplar-based inpa...
Emmanuel d'Angelo, Pierre Vandergheynst