Sciweavers

217 search results - page 40 / 44
» Backdoors To Typical Case Complexity
Sort
View
114
Voted
ICALP
1993
Springer
15 years 3 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
APCCM
2006
15 years 15 days ago
Network data mining: methods and techniques for discovering deep linkage between attributes
Network Data Mining identifies emergent networks between myriads of individual data items and utilises special algorithms that aid visualisation of `emergent' patterns and tre...
John Galloway, Simeon J. Simoff
BMCBI
2008
132views more  BMCBI 2008»
14 years 11 months ago
Exon level integration of proteomics and microarray data
Background: Previous studies comparing quantitative proteomics and microarray data have generally found poor correspondence between the two. We hypothesised that this might in par...
Danny A. Bitton, Michal J. Okoniewski, Yvonne Conn...
SIGSOFT
2007
ACM
15 years 11 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
15 years 11 months ago
A framework for classification and segmentation of massive audio data streams
In recent years, the proliferation of VOIP data has created a number of applications in which it is desirable to perform quick online classification and recognition of massive voi...
Charu C. Aggarwal