Sciweavers

1060 search results - page 191 / 212
» On the Discovery of Random Trees
Sort
View
IEEESCC
2009
IEEE
14 years 7 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
CVPR
2011
IEEE
14 years 6 months ago
Coupled Information-Theoretic Encoding for Face Photo-Sketch Recognition
Automatic face photo-sketch recognition has important applications to law enforcement. Recent research has focused on transforming photos and sketches into the same modality for m...
Wei Zhang, Xiaogang Wang, Xiaoou Tang
IJRR
2011
174views more  IJRR 2011»
14 years 5 months ago
Bounding on rough terrain with the LittleDog robot
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...
ITIIS
2010
247views more  ITIIS 2010»
14 years 4 months ago
An Efficient Overlay for Unstructured P2P File Sharing over MANET using Underlying Cluster-based Routing
In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic ...
Nadir Shah, Depei Qian
SIAMDM
2010
131views more  SIAMDM 2010»
14 years 4 months ago
On Optimal Strategies for a Hat Game on Graphs
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
Uriel Feige