Sciweavers

26354 search results - page 44 / 5271
» How we refactor, and how we know it
Sort
View
CIE
2005
Springer
14 years 1 months ago
How to Compare the Power of Computational Models
We argue that there is currently no satisfactory general framework for comparing the extensional computational power of arbitrary computational models operating over arbitrary doma...
Udi Boker, Nachum Dershowitz
ASIACRYPT
2009
Springer
13 years 11 months ago
Hedged Public-Key Encryption: How to Protect against Bad Randomness
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas ...
COLT
2008
Springer
13 years 9 months ago
How Local Should a Learning Method Be?
We consider the question of why modern machine learning methods like support vector machines outperform earlier nonparametric techniques like kNN. Our approach investigates the lo...
Alon Zakai, Yaacov Ritov
ICASSP
2011
IEEE
12 years 11 months ago
How efficient is estimation with missing data?
In this paper, we present a new evaluation approach for missing data techniques (MDTs) where the efficiency of those are investigated using listwise deletion method as reference....
Seliz G. Karadogan, Letizia Marchegiani, Lars Kai ...
WISE
2007
Springer
14 years 2 months ago
How Do Users Express Goals on the Web? - An Exploration of Intentional Structures in Web Search
Many activities on the web are driven by high-level goals of users, such as “plan a trip” or “buy some product”. In this paper, we are interested in exploring the role and ...
Markus Strohmaier, Mathias Lux, Michael Granitzer,...