Sciweavers

2913 search results - page 516 / 583
» How Much to Copy
Sort
View
SIGIR
2009
ACM
14 years 3 months ago
Evaluating web search using task completion time
We consider experiments to measure the quality of a web search algorithm based on how much total time users take to complete assigned search tasks using that algorithm. We first ...
Ya Xu, David Mease
EDBT
2010
ACM
155views Database» more  EDBT 2010»
14 years 3 months ago
Reducing metadata complexity for faster table summarization
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
K. Selçuk Candan, Mario Cataldi, Maria Luis...
CISS
2008
IEEE
14 years 3 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
HICSS
2008
IEEE
114views Biometrics» more  HICSS 2008»
14 years 3 months ago
Leveraging the Wisdom of Crowds: Designing an IT-Supported Ideas Competition for an ERP Software Company
“Crowdsourcing” is currently one of the most discussed key words within the open innovation community. The major question for both research and business is how to find and lev...
Winfried Ebner, Jan Marco Leimeister, Ulrich Brets...
ICPR
2008
IEEE
14 years 3 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang