Sciweavers

3267 search results - page 255 / 654
» Generalized quasirandom graphs
Sort
View
WG
2000
Springer
15 years 10 months ago
Networks with Small Stretch Number
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
Serafino Cicerone, Gabriele Di Stefano
CIKM
2008
Springer
15 years 8 months ago
A random walk on the red carpet: rating movies with user reviews and pagerank
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
Derry Tanti Wijaya, Stéphane Bressan
LANMR
2004
15 years 8 months ago
Component-Based Answer Set Programming
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...
Stefania Costantini
AVI
2008
15 years 8 months ago
Visualizing program similarity in the Ac plagiarism detection system
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
Manuel Freire
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
15 years 8 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen