Sciweavers

9162 search results - page 1694 / 1833
» System and User Data Complexity
Sort
View
TVCG
2010
188views more  TVCG 2010»
14 years 8 months ago
Analyzing and Tracking Burning Structures in Lean Premixed Hydrogen Flames
— This paper presents topology-based methods to robustly extract, analyze, and track features defined as subsets of isosurfaces. First, we demonstrate how features identified b...
Peer-Timo Bremer, Gunther H. Weber, Valerio Pascuc...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
PODS
2005
ACM
164views Database» more  PODS 2005»
15 years 10 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
PPOPP
2006
ACM
15 years 4 months ago
On-line automated performance diagnosis on thousands of processes
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
Philip C. Roth, Barton P. Miller
BMCBI
2005
152views more  BMCBI 2005»
14 years 10 months ago
CoPub Mapper: mining MEDLINE based on search term co-publication
Background: High throughput microarray analyses result in many differentially expressed genes that are potentially responsible for the biological process of interest. In order to ...
Blaise T. F. Alako, Antoine Veldhoven, Sjozef van ...
« Prev « First page 1694 / 1833 Last » Next »