478 search results - page 78 / 96 » Context-Sensitive Dependency Pairs |
124
click to vote
SAC
2011
ACM
14 years 2 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
185
click to vote
CRV
2011
IEEE
13 years 11 months ago
2011
IEEE
—We consider the problem of exploring an unknown environment with a pair of mobile robots. The goal is to make the robots meet (or rendezvous) in minimum time such that there is ...
CVPR
2000
IEEE
16 years 1 months ago
2000
IEEE
We presen t a multiview method for the computation of object shape and re ectance characteristics based on the integration of shape from shading (SFS) and stereo, for nonconstan t...
108
click to vote
ICML
2004
IEEE
16 years 18 days ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
DSD
2009
IEEE
15 years 6 months ago
2009
IEEE
—The scalability and performance of the Internet depends critically on the performance of its packet switches. Current packet switches are based on single-hop crossbar fabrics, w...