Sciweavers

1254 search results - page 14 / 251
» Making Hard Problems Harder
Sort
View
ACNS
2006
Springer
109views Cryptology» more  ACNS 2006»
14 years 1 months ago
Misusing Unstructured P2P Systems to Perform DoS Attacks: The Network That Never Forgets
Unstructured P2P systems have gained great popularity in recent years and are currently used by millions of users. One fundamental property of these systems is the lack of structu...
Elias Athanasopoulos, Kostas G. Anagnostakis, Evan...
HICSS
2008
IEEE
150views Biometrics» more  HICSS 2008»
14 years 2 months ago
Quantitative Early-Phase User Research Methods: Hard Data for Initial Product Design
We describe questions that commonly arise in early-phase user research for new technology products concerning customer needs, priorities, and market definition. We suggest that me...
Christopher N. Chapman, Edwin Love, James L. Alfor...
CG
2002
Springer
13 years 7 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao
CIKM
2001
Springer
14 years 3 days ago
Towards Speech as a Knowledge Resource
Speech is a tantalizing mode of human communication. On one hand, humans understand speech with ease and use speech to express complex ideas, information, and knowledge. On the ot...
Eric W. Brown, Savitha Srinivasan, Anni Coden, Dul...
OWLED
2008
13 years 9 months ago
Pellint - A Performance Lint Tool for Pellet
Predicting the performance of a tableau reasoner for an OWL ontology is generally hard. It is even harder for users who are not familiar with the details of tableau algorithms. In ...
Harris Lin, Evren Sirin