1538 search results - page 160 / 308 » Spectral Techniques in Graph Algorithms |
115
click to vote
MICCAI
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
151
click to vote
CIIA
2009
15 years 5 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
124
Voted
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
155
Voted
IEEEPACT
1997
IEEE
15 years 8 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
112
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...