Sciweavers

905 search results - page 73 / 181
» On the Complexity of uSPR Distance
Sort
View
TSMC
2002
80views more  TSMC 2002»
14 years 9 months ago
Performance metric alerting: a new design approach for complex alerting problems
Alerting systems and related decision-making automation are widely used to enhance the safety and capability of controlled processes across many applications. Traditional alerting ...
L. C. Yang, J. K. Kuchar
NETWORKS
2010
14 years 8 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
CVPR
2009
IEEE
16 years 5 months ago
Locally Time-Invariant models of Human Activities using Trajectories on the Grassmanian
Human activity analysis is an important problem in computer vision with applications in surveillance and summarization and indexing of consumer content. Complex human activities...
Pavan Turaga, Rama Chellappa
CVPR
2006
IEEE
15 years 12 months ago
SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...
Alexander C. Berg, Hao Zhang 0003, Jitendra Malik,...
DAC
2007
ACM
15 years 10 months ago
An Effective Guidance Strategy for Abstraction-Guided Simulation
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
Flavio M. de Paula, Alan J. Hu