Sciweavers

598 search results - page 111 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
STACS
2005
Springer
14 years 6 days ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
WPES
2003
ACM
13 years 12 months ago
Analysis of privacy preserving random perturbation techniques: further explorations
Privacy is becoming an increasingly important issue in many data mining applications, particularly in the security and defense area. This has triggered the development of many pri...
Haimonti Dutta, Hillol Kargupta, Souptik Datta, Kr...
BMCBI
2006
112views more  BMCBI 2006»
13 years 6 months ago
Protein disorder prediction by condensed PSSM considering propensity for order or disorder
Background: More and more disordered regions have been discovered in protein sequences, and many of them are found to be functionally significant. Previous studies reveal that dis...
Chung-Tsai Su, Chien-Yu Chen, Yu-Yen Ou
JLP
2006
98views more  JLP 2006»
13 years 6 months ago
Partiality I: Embedding relation algebras
As long as no cooperation between processes is supposed to take place, one may consider them separately and need not ask for the progress of the respective other processes. If a c...
Gunther Schmidt
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 6 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer