Sciweavers

2512 search results - page 500 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
BMCBI
2005
95views more  BMCBI 2005»
14 years 9 months ago
Commensurate distances and similar motifs in genetic congruence and protein interaction networks in yeast
Background: In a genetic interaction, the phenotype of a double mutant differs from the combined phenotypes of the underlying single mutants. When the single mutants have no growt...
Ping Ye, Brian D. Peyser, Forrest A. Spencer, Joel...
TSP
2008
151views more  TSP 2008»
14 years 9 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
SOCA
2010
IEEE
14 years 8 months ago
Weighted fair share scheduling for loosely controlled concurrent event systems
In asynchronous event systems, the production of an event is decoupled from its consumption via an event queue. The loose coupling of such systems allows great flexibility as to ...
Sean Rooney, Luis Garcés-Erice, Kristijan D...
PVLDB
2011
14 years 14 days ago
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
Stratos Idreos, Stefan Manegold, Harumi A. Kuno, G...
88
Voted
SAC
2011
ACM
14 years 13 days ago
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
Michael Haupt, Michael Perscheid, Robert Hirschfel...