Sciweavers

10997 search results - page 253 / 2200
» On the Structure of Complete Sets
Sort
View
COMPGEOM
2009
ACM
16 years 1 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
TSP
2008
151views more  TSP 2008»
15 years 6 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
PODC
2009
ACM
16 years 7 months ago
Partial synchrony based on set timeliness
d Abstract] Marcos K. Aguilera Microsoft Research Silicon Valley Mountain View, CA, USA Carole Delporte-Gallet Universit? Paris 7 Paris, France Hugues Fauconnier Universit? Paris ...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
CSCL
2008
106views more  CSCL 2008»
15 years 6 months ago
Operationalizing macro-scripts in CSCL technological settings
: This paper presents a conceptual analysis of the technological dimensions related to the operationalization of CSCL macro-scripts. CSCL scripts are activity models that aim at en...
Pierre Tchounikine
BMCBI
2007
166views more  BMCBI 2007»
15 years 6 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour