5606 search results - page 475 / 1122 » Randomization Techniques for Graphs. |
209
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
181
click to vote
SIGMOD
2010
ACM
15 years 11 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...
198
click to vote
ESEC
1997
Springer
15 years 11 months ago
1997
Springer
The idea of a combined reference model- and view-based specification approach has been proposed recently in the software engineering community. In this paper we present a specifica...
185
click to vote
WADT
1997
Springer
15 years 11 months ago
1997
Springer
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
163
click to vote
MICCAI
2000
Springer
15 years 10 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...