333 search results - page 38 / 67 » A Functional Approach to External Graph Algorithms |
IJCV
2006
13 years 8 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
SAS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
STOC
1995
ACM
14 years 8 days ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
ICANN
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Classification of structured data (i.e., data that are represented as graphs) is a topic of interest in the machine learning community. This paper presents a different,...
HYBRID
2001
Springer
14 years 1 months ago
2001
Springer
Efficient algorithms exist for fault detection and isolation of physical systems based on functional redundancy. In a qualitative approach, this redundancy can be captured by a tem...