2913 search results - page 516 / 583 » How Much to Copy |
135
Voted
SIGIR
2009
ACM
15 years 10 months ago
2009
ACM
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 ...
107
Voted
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
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...
130
Voted
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
138
Voted
HICSS
2008
IEEE
15 years 10 months ago
2008
IEEE
“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...
133
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
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 ...