Sciweavers

1983 search results - page 263 / 397
» Competitive graph searches
Sort
View
101
Voted
IROS
2007
IEEE
206views Robotics» more  IROS 2007»
15 years 9 months ago
Dexterous manipulation planning using probabilistic roadmaps in continuous grasp subspaces
— In this paper, we propose a new method for the motion planning problem of rigid object dexterous manipulation with a robotic multi-fingered hand, under quasi-static movement a...
Jean-Philippe Saut, Anis Sahbani, Sahar El-Khoury,...
134
Voted
PDP
2006
IEEE
15 years 8 months ago
Parallel Adaptive Technique for Computing PageRank
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
Arnon Rungsawang, Bundit Manaskasemsak
153
Voted
DILS
2004
Springer
15 years 6 months ago
Efficient Techniques to Explore and Rank Paths in Life Science Data Sources
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...
Zoé Lacroix, Louiqa Raschid, Maria-Esther V...
110
Voted
AAAI
2008
15 years 5 months ago
Efficient Optimization of Information-Theoretic Exploration in SLAM
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
Thomas Kollar, Nicholas Roy
143
Voted
CIKM
2008
Springer
15 years 4 months ago
Query suggestion using hitting time
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such sugges...
Qiaozhu Mei, Dengyong Zhou, Kenneth Ward Church