Sciweavers

1568 search results - page 75 / 314
» The problem of examination questions in algorithmics
Sort
View
WWW
2010
ACM
15 years 11 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
AB
2007
Springer
15 years 10 months ago
Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks
A series of papers, all under the title of Algorithmic Algebraic Model Checking (AAMC), has sought to combine techniques from algorithmic algebra, model checking and dynamical syst...
Venkatesh Mysore, Bud Mishra
JSAT
2008
122views more  JSAT 2008»
15 years 4 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
ICAISC
2010
Springer
15 years 9 months ago
A New Implementation of the co-VAT Algorithm for Visual Assessment of Clusters in Rectangular Relational Data
This paper presents a new implementation of the co-VAT algorithm. We assume we have an m × n matrix D, where the elements of D are pair-wise dissimilarities between m row objects ...
Timothy C. Havens, James C. Bezdek, James M. Kelle...
ICMCS
2007
IEEE
79views Multimedia» more  ICMCS 2007»
15 years 10 months ago
Pop Music Beat Detection in the Huffman Coded Domain
This paper presents a novel beat detector that operates in the Huffman coded domain of a MP3 audio bitstream. We seek to answer two main questions. First, whether it is possible t...
Jia Zhu, Ye Wang