Sciweavers

1816 search results - page 316 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ICRA
2008
IEEE
128views Robotics» more  ICRA 2008»
16 years 20 days ago
A point-based POMDP planner for target tracking
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
David Hsu, Wee Sun Lee, Nan Rong
ICPADS
2007
IEEE
16 years 17 days ago
A forwarding model for Voronoi-based Overlay Network
One recent approach to build highly scalable and robust networked virtual environments (NVEs) is by using peer-to-peer overlay networks. Voronoi-based Overlay Network (VON) has be...
Jui-Fa Chen, Wei-Chuan Lin, Tsu-Han Chen, Shun-Yun...
ASIACRYPT
2007
Springer
16 years 13 days ago
How to Build a Hash Function from Any Collision-Resistant Function
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
Thomas Ristenpart, Thomas Shrimpton
ATAL
2007
Springer
16 years 13 days ago
SSDPOP: improving the privacy of DCOP with secret sharing
Multi-agent systems designed to work collaboratively with groups of people typically require private information that people will entrust to them only if they have assurance that ...
Rachel Greenstadt, Barbara J. Grosz, Michael D. Sm...
CPM
2007
Springer
99views Combinatorics» more  CPM 2007»
16 years 13 days ago
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson