Sciweavers

1132 search results - page 61 / 227
» Structural Average Case Complexity
Sort
View
BMCBI
2008
142views more  BMCBI 2008»
13 years 9 months ago
Microarray data mining: A novel optimization-based approach to uncover biologically coherent structures
Background: DNA microarray technology allows for the measurement of genome-wide expression patterns. Within the resultant mass of data lies the problem of analyzing and presenting...
Meng Piao Tan, Erin N. Smith, James R. Broach, Chr...
IJAC
2008
97views more  IJAC 2008»
13 years 8 months ago
Random Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
Frédérique Bassino, Cyril Nicaud, Pa...
WWW
2008
ACM
14 years 9 months ago
Scaling RDF with time
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
Andrea Pugliese, Octavian Udrea, V. S. Subrahmania...
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
14 years 9 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan
COLT
2003
Springer
14 years 2 months ago
On-Line Learning with Imperfect Monitoring
We study on-line play of repeated matrix games in which the observations of past actions of the other player and the obtained reward are partial and stochastic. We define the Part...
Shie Mannor, Nahum Shimkin