Sciweavers

8655 search results - page 1408 / 1731
» Challenges for Trusted Computing
Sort
View
154
Voted
ICRA
2010
IEEE
132views Robotics» more  ICRA 2010»
15 years 2 months ago
Sampling-based motion planning with temporal goals
Abstract— This paper presents a geometry-based, multilayered synergistic approach to solve motion planning problems for mobile robots involving temporal goals. The temporal goals...
Amit Bhatia, Lydia E. Kavraki, Moshe Y. Vardi
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
15 years 2 months ago
Planning for autonomous door opening with a mobile manipulator
Abstract— Computing a motion that enables a mobile manipulator to open a door is challenging because it requires tight coordination between the motions of the arm and the base. H...
Sachin Chitta, Benjamin J. Cohen, Maxim Likhachev
124
Voted
ICWS
2010
IEEE
15 years 2 months ago
Enhancing Scalability and Performance of Mashups Through Merging and Operator Reordering
Abstract—Recently, mashups are gaining tremendous popularity as an important Web 2.0 application. Mashups provide end-users with an opportunity to create personalized Web service...
Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. ...
150
Voted
KBS
2008
98views more  KBS 2008»
15 years 2 months ago
Mixed feature selection based on granulation and approximation
Feature subset selection presents a common challenge for the applications where data with tens or hundreds of features are available. Existing feature selection algorithms are mai...
Qinghua Hu, Jinfu Liu, Daren Yu
141
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
Yunfeng Lin, Ben Liang, Baochun Li
« Prev « First page 1408 / 1731 Last » Next »