Sciweavers

26354 search results - page 174 / 5271
» How we refactor, and how we know it
Sort
View
SYNTHESE
2008
84views more  SYNTHESE 2008»
13 years 10 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
ISVC
2010
Springer
13 years 9 months ago
How to Overcome Perceptual Aliasing in ASIFT?
SIFT is one of the most popular algorithms to extract points of interest from images. It is a scale+rotation invariant method. As a consequence, if one compares points of interest ...
Nicolas Noury, Frédéric Sur, Marie-O...
CHI
2011
ACM
13 years 2 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
CHI
2006
ACM
14 years 11 months ago
Desperately seeking simplicity: how young adults with cognitive disabilities and their families adopt assistive technologies
A surprisingly high percentage of assistive technology devices (35% or more) are purchased, but not successfully adopted. Through semi-structured interviews with a dozen families,...
Melissa Dawe
ISPW
2010
IEEE
14 years 3 months ago
How to Welcome Software Process Improvement and Avoid Resistance to Change
Pressures for more complex products, customer dissatisfaction and problems related to cost and schedule overruns increase the need for effective management response and for improve...
Daniela Cristina Cascini Peixoto, Vitor A. Batista...