Sciweavers

1568 search results - page 91 / 314
» The problem of examination questions in algorithmics
Sort
View
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
16 years 1 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
INFOCOM
2008
IEEE
15 years 10 months ago
Towards a Theory of Robust Localization Against Malicious Beacon Nodes
—Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundament...
Sheng Zhong, Murtuza Jadliwala, Shambhu J. Upadhya...
CHI
2010
ACM
15 years 11 months ago
Multi-lifespan information system design: a research initiative for the hci community
This CHI Note proposes a new research initiative for the HCI community: multi-lifespan information system design. The central idea begins with the identification of categories of ...
Batya Friedman, Lisa P. Nathan
HICSS
2005
IEEE
91views Biometrics» more  HICSS 2005»
15 years 10 months ago
Size Does Matter in Computer Collaboration: Heterogeneous Platform Effects on Human-Human Interaction
Because today’s workforce is highly mobile, small wireless devices are being used to support mobile work collaboration. However, do computer platform differences affect such col...
Marilyn Tremaine, Aleksandra Sarcevic, Dezhi Wu, M...
ICDAR
2007
IEEE
15 years 8 months ago
On Computing Strength of Evidence for Writer Verification
The problem of Writer Verification is to make a decision of whether or not two handwritten documents are written by the same person. Providing a strength of evidence for any such ...
Harish Srinivasan, S. Kabra, Chen Huang, Sargur N....