5606 search results - page 296 / 1122 » Randomization Techniques for Graphs. |
193
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
160
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
189
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
180
click to vote
ESWS
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. This paper studies the RDF model from a database perspective. From this point of view it is compared with other database models, particularly with graph database models, ...
163
click to vote
AMAI
2004
Springer
15 years 12 months ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...