Sciweavers

335 search results - page 13 / 67
» How Serious are serious games
Sort
View
ICML
2006
IEEE
14 years 11 months ago
How boosting the margin can also boost classifier complexity
Boosting methods are known not to usually overfit training data even as the size of the generated classifiers becomes large. Schapire et al. attempted to explain this phenomenon i...
Lev Reyzin, Robert E. Schapire
COLCOM
2008
IEEE
14 years 5 months ago
Collaborative Search and User Privacy: How Can They Be Reconciled?
Abstract. Collaborative search engines (CSE) let users pool their resources and share their experiences when seeking information on the web. However, when shared, search terms and ...
Thorben Burghardt, Erik Buchmann, Klemens Böh...
BLISS
2007
IEEE
14 years 5 months ago
Evolving the Face of a Criminal: How to Search a Face Space More Effectively
Witnesses and victims of serious crime are often required to construct a facial composite, a visual likeness of a suspect’s face. The traditional method is for them to select in...
Charlie D. Frowd, Vicki Bruce, Carol Gannon, Mark ...
FSE
2006
Springer
117views Cryptology» more  FSE 2006»
14 years 2 months ago
How Far Can We Go on the x64 Processors?
This paper studies the state-of-the-art software optimization methodology for symmetric cryptographic primitives on the new 64-bit x64 processors, AMD Athlon64 (AMD64) and Intel Pe...
Mitsuru Matsui
CCS
2011
ACM
12 years 10 months ago
How to break XML encryption
XML Encryption was standardized by W3C in 2002, and is implemented in XML frameworks of major commercial and open-source organizations like Apache, redhat, IBM, and Microsoft. It ...
Tibor Jager, Somorovsky Juraj