Sciweavers

275 search results - page 51 / 55
» Parameterized Complexity of Generalized Vertex Cover Problem...
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 1 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
WPES
2003
ACM
15 years 4 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
ATAL
2006
Springer
15 years 3 months ago
Continuous refinement of agent resource estimates
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
David N. Morley, Karen L. Myers, Neil Yorke-Smith
SIAMIS
2011
14 years 6 months ago
A New Geometric Metric in the Space of Curves, and Applications to Tracking Deforming Objects by Prediction and Filtering
We define a novel metric on the space of closed planar curves which decomposes into three intuitive components. According to this metric centroid translations, scale changes and ...
Ganesh Sundaramoorthi, Andrea Mennucci, Stefano So...
PLDI
2005
ACM
15 years 5 months ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...