Sciweavers

6455 search results - page 363 / 1291
» Research problems
Sort
View
SIGACT
2010
74views more  SIGACT 2010»
15 years 5 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel
181
Voted
ISPW
2010
IEEE
15 years 4 months ago
Critical Success Factors for Rapid, Innovative Solutions
Many of today's problems are in search of new, innovative solutions. However, the development of new and innovative solutions has been elusive to many, resulting in considerab...
Jo Ann Lane, Barry W. Boehm, Mark T. Bolas, Azad M...
MIG
2010
Springer
15 years 4 months ago
Why Is the Creation of a Virtual Signer Challenging Computer Animation?
Virtual signers communicating in signed languages are a very interesting tool to serve as means of communication with deaf people and improve their access to services and informati...
Nicolas Courty, Sylvie Gibet
EMNLP
2009
15 years 4 months ago
A Compact Forest for Scalable Inference over Entailment and Paraphrase Rules
A large body of recent research has been investigating the acquisition and application of applied inference knowledge. Such knowledge may be typically captured as entailment rules...
Roy Bar-Haim, Jonathan Berant, Ido Dagan
HCI
2009
15 years 4 months ago
An Empirical Analysis of Personal Digital Document Structures
Hierarchies have long been used as useful structuring mechanisms for organizing and managing documents. This study looks at the problem of personal digital document management in t...
Sarah Henderson, Ananth Srinivasan