Sciweavers

1024 search results - page 25 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
JSAC
2006
157views more  JSAC 2006»
14 years 9 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
ANCS
2007
ACM
15 years 1 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
CDC
2010
IEEE
117views Control Systems» more  CDC 2010»
14 years 4 months ago
Distributed iterative regularization algorithms for monotone Nash games
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
Aswin Kannan, Uday V. Shanbhag
ISCAS
2011
IEEE
237views Hardware» more  ISCAS 2011»
14 years 1 months ago
A new network-based algorithm for multi-camera abnormal activity detection
In this paper, a new abnormal activity detection algorithm is proposed for multi-camera surveillance applications. The proposed algorithm models the entire scene covered by the mu...
Hongyu Gao, Weiyao Lin, Xiaokang Yang, Hongxiang L...
CVPR
2009
IEEE
16 years 5 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...