Sciweavers

8695 search results - page 1579 / 1739
» Making the Complex Simple
Sort
View
BMCBI
2006
133views more  BMCBI 2006»
15 years 3 months ago
Web-based analysis of the mouse transcriptome using Genevestigator
Background: Gene function analysis often requires a complex and laborious sequence of laboratory and computer-based experiments. Choosing an effective experimental design generall...
Oliver Laule, Matthias Hirsch-Hoffmann, Tomas Hruz...
BMCBI
2006
116views more  BMCBI 2006»
15 years 3 months ago
Optimized mixed Markov models for motif identification
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
Weichun Huang, David M. Umbach, Uwe Ohler, Leping ...
COMGEO
2006
ACM
15 years 3 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
109
Voted
CSDA
2006
72views more  CSDA 2006»
15 years 3 months ago
Generalized theory of uncertainty (GTU) - principal concepts and ideas
Uncertainty is an attribute of information. The path-breaking work of Shannon has led to a universal acceptance of the thesis that information is statistical in nature. Concomitan...
Lotfi A. Zadeh
DATAMINE
2006
89views more  DATAMINE 2006»
15 years 3 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
« Prev « First page 1579 / 1739 Last » Next »