Sciweavers

597 search results - page 76 / 120
» Homomorphisms of random paths
Sort
View
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
14 years 4 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou
ICRA
2008
IEEE
140views Robotics» more  ICRA 2008»
14 years 4 months ago
An optimization approach to planning for mobile manipulation
— We present an optimization-based approach to grasping and path planning for mobile manipulators. We focus on pick-and-place operations, where a given object must be moved from ...
Dmitry Berenson, James Kuffner, Howie Choset
INFOCOM
2008
IEEE
14 years 4 months ago
Non-Metric Coordinates for Predicting Network Proximity
—We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metr...
Peter B. Key, Laurent Massoulié, Dan-Cristi...
GLOBECOM
2007
IEEE
14 years 4 months ago
Babel: Using a Common Bridge Node to Deliver Multiple Keys in Wireless Sensor Networks
— In Wireless Sensor Networks (WSNs), symmetric key schemes may be used to provide security. Recently, a class of random key pre-distribution techniques have been proposed and in...
Jing Deng, Yunghsiang S. Han
GLOBECOM
2007
IEEE
14 years 4 months ago
On the (in)Effectiveness of Probabilistic Marking for IP Traceback Under DDoS Attacks
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
Vamsi Paruchuri, Arjan Durresi, Raj Jain