Sciweavers

8298 search results - page 1445 / 1660
» On the Complexity of Numerical Analysis
Sort
View
SCN
2010
Springer
145views Communications» more  SCN 2010»
15 years 5 months ago
Distributed Private-Key Generators for Identity-Based Cryptography
An identity-based encryption (IBE) scheme can greatly reduce the complexity of sending encrypted messages. However, an IBE scheme necessarily requires a private-key generator (PKG)...
Aniket Kate, Ian Goldberg
SCP
2010
126views more  SCP 2010»
15 years 5 months ago
Component simulation-based substitutivity managing QoS and composition issues
Several scientic bottlenecks have been identied in existing component-based approaches. em, we focus on the identication of a relevant abstraction for the component expression ...
Pierre-Cyrille Héam, Olga Kouchnarenko, J&e...
189
Voted
SPIRE
2010
Springer
15 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TROB
2010
93views more  TROB 2010»
15 years 5 months ago
Compliant Control of Multicontact and Center-of-Mass Behaviors in Humanoid Robots
Abstract—This paper presents a new methodology for the analysis and control of internal forces and center-of-mass (CoM) behavior, which are produced during multicontact interacti...
Luis Sentis, Jaeheung Park, Oussama Khatib
ACL
2010
15 years 4 months ago
Towards Robust Multi-Tool Tagging. An OWL/DL-Based Approach
This paper describes a series of experiments to test the hypothesis that the parallel application of multiple NLP tools and the integration of their results improves the correctne...
Christian Chiarcos
« Prev « First page 1445 / 1660 Last » Next »