9532 search results - page 376 / 1907 » Logic, Graphs, and Algorithms |
172
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
176
click to vote
SOFSEM
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
161
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
207
click to vote
ILP
2007
Springer
16 years 28 days ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
132
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present a timing optimization algorithm based on the concept of gate duplication on the technologydecomposed network. We first examine the relationship between gate duplication...