Sciweavers

9736 search results - page 12 / 1948
» How Fast Can We Compute Products
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 9 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
ICALP
2005
Springer
15 years 9 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
CVPR
2009
IEEE
1096views Computer Vision» more  CVPR 2009»
16 years 10 months ago
How far can you get with a modern face recognition test set using only simple features?
In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously ...
Nicolas Pinto, James J. DiCarlo, David D. Cox
CHB
2011
93views more  CHB 2011»
14 years 7 months ago
Web Wisdom: An essay on how Web 2.0 and Semantic Web can foster a global knowledge society
Admittedly this is a presumptuous title that should never be used when reporting on individual research advances. Wisdom is just not a scientific concept. In this case, though, w...
Christopher Thomas, Amit P. Sheth
CHI
2011
ACM
14 years 7 months ago
Donate for credibility: how contribution incentives can improve credibility
This study explores whether certain contribution incentives for online user-generated content can undermine or enhance contributor’s credibility. Through an online experiment, w...
Gary Hsieh, Scott E. Hudson, Robert E. Kraut