Sciweavers

228 search results - page 35 / 46
» Estimating Commit Sizes Efficiently
Sort
View
WWW
2005
ACM
16 years 4 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
FOCS
1999
IEEE
15 years 7 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
160
Voted
BMCBI
2008
186views more  BMCBI 2008»
15 years 3 months ago
Variable selection for large p small n regression models with incomplete data: Mapping QTL with epistases
Background: Identifying quantitative trait loci (QTL) for both additive and epistatic effects raises the statistical issue of selecting variables from a large number of candidates...
Min Zhang, Dabao Zhang, Martin T. Wells
154
Voted
CN
2008
127views more  CN 2008»
15 years 3 months ago
Decentralized detection of global threshold crossings using aggregation trees
The timely detection that a monitored variable has crossed a given threshold is a fundamental requirement for many network management applications. A challenge is the detection of ...
Fetahi Wuhib, Mads Dam, Rolf Stadler
VIS
2005
IEEE
150views Visualization» more  VIS 2005»
16 years 4 months ago
VolumeExplorer: Roaming Large Volumes to Couple Visualization and Data Processing for Oil and Gas Exploration
In this paper, we present a volume roaming system dedicated to oil and gas exploration. Our system combines probebased volume rendering with data processing and computing. The dai...
Laurent Castanie, Bruno Lévy, Fabien Bosque...