Sciweavers

550 search results - page 89 / 110
» pairing 2009
Sort
View
NETWORKS
2007
13 years 9 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
CVPR
2009
IEEE
15 years 4 months ago
D - Clutter: Building object model library from unsupervised segmentation of cluttered scenes
Autonomous systems which learn and utilize a limited visual vocabulary have wide spread applications. Enabling such systems to segment a set of cluttered scenes into objects is ...
Chandra Kambhamettu, Dimitris N. Metaxas, Gowri So...
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 8 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
JAT
2010
88views more  JAT 2010»
13 years 8 months ago
Cauchy biorthogonal polynomials
The paper investigates the properties of certain biorthogonal polynomials appearing in a specific simultaneous Hermite–Pad´e approximation scheme. Associated with any totally ...
M. Bertola, M. Gekhtman, J. Szmigielski
ACCV
2009
Springer
13 years 7 months ago
Human Action Recognition under Log-Euclidean Riemannian Metric
This paper presents a new action recognition approach based on local spatio-temporal features. The main contributions of our approach are twofold. First, a new local spatio-tempora...
Chunfeng Yuan, Weiming Hu, Xi Li, Stephen J. Mayba...