Sciweavers

961 search results - page 129 / 193
» Significance-Driven Graph Clustering
Sort
View
AVI
2008
15 years 5 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
SOSP
2009
ACM
16 years 1 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
NAR
2008
175views more  NAR 2008»
15 years 4 months ago
Onto-CC: a web server for identifying Gene Ontology conceptual clusters
The Gene Ontology (GO) vocabulary has been extensively explored to analyze the functions of coexpressed genes. However, despite its extended use in Biology and Medical Sciences, t...
Rocío Romero-Záliz, Coral del Val, J...
ICML
2004
IEEE
16 years 5 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 10 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim