Sciweavers

16404 search results - page 2418 / 3281
» A set coverage problem
Sort
View
BMCBI
2011
15 years 2 months ago
A novel approach to the clustering of microarray data via nonparametric density estimation
Background: Cluster analysis is a crucial tool in several biological and medical studies dealing with microarray data. Such studies pose challenging statistical problems due to di...
Riccardo De Bin, Davide Risso
IANDC
2011
148views more  IANDC 2011»
15 years 2 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
JAIR
2011
134views more  JAIR 2011»
15 years 2 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
JCT
2011
90views more  JCT 2011»
15 years 2 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
JCT
2011
89views more  JCT 2011»
15 years 2 months ago
On lines, joints, and incidences in three dimensions
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz [7], to obtain several sharp bounds on the number of incidences between lines and points in three ...
György Elekes, Haim Kaplan, Micha Sharir
« Prev « First page 2418 / 3281 Last » Next »