Results 1 - 10 of 66,816

Functional discovery via a compendium of expression profiles.

by Timothy R Hughes , Matthew J Marton , Allan R Jones , Christopher J Roberts , Roland Stoughton , Christopher D Armour , Holly A Bennett , Ernest Coffey , Hongyue Dai , Ross-Macdonald , Yudong D He , Matthew J Kidd , Amy M King , Michael R Meyer , David Slade , Pek Y Lum , Sergey B Stepaniants , Daniel D Shoemaker , Julian Simon , Martin Bard - Cell, , 2000
"... provided that the cellular transcriptional response to frames encode proteins required for sterol metabodisruption of different steps in the same pathway is lism, cell wall function, mitochondrial respiration, or similar, and that there are sufficiently unique transcripprotein synthesis. We also sh ..."
Abstract - Cited by 547 (9 self) - Add to MetaCart
provided that the cellular transcriptional response to frames encode proteins required for sterol metabodisruption of different steps in the same pathway is lism, cell wall function, mitochondrial respiration, or similar, and that there are sufficiently unique transcripprotein synthesis. We also

Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals

by Jim Gray, Adam Bosworth, Andrew Layman, Don Reichart, Hamid Pirahesh , 1996
"... Abstract. Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zero-dimensional or one-dimensional aggregates. Applications need the N-dimensional generalization of these op ..."
Abstract - Cited by 860 (11 self) - Add to MetaCart
Abstract. Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zero-dimensional or one-dimensional aggregates. Applications need the N-dimensional generalization

Cluster analysis and display of genome-wide expression patterns’,

by Michael B Eisen , Paul T Spellman , Patrick O Brown , David Botstein - Proc. Natl. Acad. , 1998
"... ABSTRACT A system of cluster analysis for genome-wide expression data from DNA microarray hybridization is described that uses standard statistical algorithms to arrange genes according to similarity in pattern of gene expression. The output is displayed graphically, conveying the clustering and th ..."
Abstract - Cited by 2895 (44 self) - Add to MetaCart
and the underlying expression data simultaneously in a form intuitive for biologists. We have found in the budding yeast Saccharomyces cerevisiae that clustering gene expression data groups together efficiently genes of known similar function, and we find a similar tendency in human data. Thus patterns seen

Coverage Control for Mobile Sensing Networks

by Jorge Cortes, Sonia Martínez, Timur Karatas, Francesco Bullo , 2002
"... This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functio ..."
Abstract - Cited by 582 (49 self) - Add to MetaCart
This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility

Identity-Based Encryption from the Weil Pairing

by Dan Boneh, Matthew Franklin , 2001
"... We propose a fully functional identity-based encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract - Cited by 1748 (28 self) - Add to MetaCart
We propose a fully functional identity-based encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem. Our system is based on bilinear maps between groups. The Weil pairing

Optimizing Search Engines using Clickthrough Data

by Thorsten Joachims , 2002
"... This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches ..."
Abstract - Cited by 1314 (23 self) - Add to MetaCart
function of a meta-search engine to a particular group of users, outperforming Google in terms of retrieval quality after only a couple of hundred training examples.

Finding community structure in networks using the eigenvectors of matrices

by M. E. J. Newman , 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract - Cited by 502 (0 self) - Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible

Consensus Problems in Networks of Agents with Switching Topology and Time-Delays

by Reza Olfati Saber, Richard M. Murray , 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or leader ..."
Abstract - Cited by 1112 (21 self) - Add to MetaCart
leader determination) for groups of discrete-time agents. In each case, we introduce a linear/nonlinear consensus protocol and provide convergence analysis for the proposed distributed algorithm. Moreover, we establish a connection between the Fiedler eigenvalue of the information flow in a network (i

A volumetric method for building complex models from range images,”

by Brian Curless , Marc Levoy - in Proceedings of the 23rd annual conference on Computer graphics and interactive techniques. ACM, , 1996
"... Abstract A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction, ..."
Abstract - Cited by 1020 (17 self) - Add to MetaCart
Abstract A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction

The transcriptional program of sporulation in budding yeast

by S. Chu, J. DeRisi, M. Eisen, J. Mulholland, D. Botstein, P. O. Brown, I. Herskowitz - SCIENCE , 1998
"... Diploid cells of budding yeast produce haploid cells through the develop-mental program of sporulation, which consists of meiosis and spore morphogenesis. DNA microarrays containing nearly every yeast gene were used to assay changes in gene expression during sporulation. At least seven distinct temp ..."
Abstract - Cited by 497 (8 self) - Add to MetaCart
temporal patterns of induction were observed. The transcription factor Ndt80 appeared to be important for induction of a large group of genes at the end of meiotic prophase. Consensus sequences known or proposed to be responsible for temporal regulation could be identified solely from analysis of sequences
Results 1 - 10 of 66,816