Sciweavers

1172 search results - page 173 / 235
» Path Algorithms on Regular Graphs
Sort
View
JMLR
2010
179views more  JMLR 2010»
14 years 8 months ago
PAC-Bayesian Analysis of Co-clustering and Beyond
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
Yevgeny Seldin, Naftali Tishby
SCAM
2008
IEEE
15 years 8 months ago
User-Input Dependence Analysis via Graph Reachability
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
Bernhard Scholz, Chenyi Zhang, Cristina Cifuentes
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
15 years 8 months ago
Potential field guide for humanoid multicontacts acyclic motion planning
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...
Karim Bouyarmane, Adrien Escande, Florent Lamiraux...
TC
2010
14 years 8 months ago
Performance Comparison of Graphics Processors to Reconfigurable Logic: A Case Study
A systematic approach to the comparison of the graphics processor (GPU) and reconfigurable logic is defined in terms of three throughput drivers. The approach is applied to five ca...
Ben Cope, Peter Y. K. Cheung, Wayne Luk, Lee W. Ho...
CAI
2002
Springer
15 years 1 months ago
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
Ivan Stojmenovic, Mark Russell, Bosko Vukojevic