Sciweavers

920 search results - page 174 / 184
» Computing the Frequency of Partial Orders
Sort
View
CHI
2008
ACM
14 years 8 months ago
LivOlay: interactive ad-hoc registration and overlapping of applications for collaborative visual exploration
The interoperability of disparate data types and sources has been a long standing problem and a hindering factor for the efficacy and efficiency in visual exploration applications...
Hao Jiang, Daniel Wigdor, Clifton Forlines, Michel...
CHI
2007
ACM
14 years 8 months ago
An eye tracking study of the effect of target rank on web search
Web search engines present search results in a rank ordered list. This works when what a user wants is near the top, but sometimes the information that the user really wants is lo...
Zhiwei Guan, Edward Cutrell
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
14 years 7 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 7 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
BICOB
2009
Springer
14 years 2 months ago
Assembly of Large Genomes from Paired Short Reads
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...