1093 search results - page 113 / 219 » Clustering from Constraint Graphs |
129
click to vote
AVI
2008
15 years 4 months ago
2008
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...
139
click to vote
NIPS
2004
15 years 5 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
111
Voted
ASPDAC
2004
ACM
15 years 9 months ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
128
click to vote
DAC
2009
ACM
16 years 4 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
112
Voted
CSCLP
2005
Springer
15 years 9 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...