Sciweavers

26354 search results - page 106 / 5271
» How we refactor, and how we know it
Sort
View
ASIACRYPT
2007
Springer
14 years 4 months ago
How to Build a Hash Function from Any Collision-Resistant Function
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
Thomas Ristenpart, Thomas Shrimpton
LPAR
2007
Springer
14 years 4 months ago
How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
Yevgeny Kazakov, Ulrike Sattler, Evgeny Zolin
IUI
2006
ACM
14 years 4 months ago
How to talk to a hologram
There is a growing need for creating life-like virtual human simulations that can conduct a natural spoken dialog with a human student on a predefined subject. We present an over...
Anton Leuski, Jarrell Pair, David R. Traum, Peter ...
MSR
2006
ACM
14 years 4 months ago
How long did it take to fix bugs?
The number of bugs (or fixes) is a common factor used to measure the quality of software and assist bug related analysis. For example, if software files have many bugs, they may b...
Sunghun Kim, E. James Whitehead Jr.
CIG
2005
IEEE
14 years 3 months ago
How to Protect Peer-to-Peer Online Games from Cheats
Abstract- Recently, P2P (peer-to-peer) online game systems have attracted a great deal of public attention. They work without central servers, thus, the maintenance and organizatio...
Haruhiro Yoshimoto, Rie Shigetomi, Hideki Imai