Sciweavers

124 search results - page 20 / 25
» The Linear Time - Branching Time Spectrum II
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
ECCV
2006
Springer
14 years 9 months ago
Cyclostationary Processes on Shape Spaces for Gait-Based Recognition
Abstract. We present a geometric and statistical approach to gaitbased human recognition. The novelty here is to consider observations of gait, considered as planar silhouettes, to...
David Kaziska, Anuj Srivastava
CVPR
2010
IEEE
14 years 3 months ago
Efficient Additive Kernels via Explicit Feature Maps
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
Andrea Vedaldi, Andrew Zisserman
MFCS
2009
Springer
14 years 1 months ago
Balanced Paths in Colored Graphs
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
Alessandro Bianco, Marco Faella, Fabio Mogavero, A...
WONS
2005
IEEE
14 years 27 days ago
A Partition Prediction Algorithm for Service Replication in Mobile Ad Hoc Networks
Due to the mobility of nodes in Ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many no...
Abdelouahid Derhab, Nadjib Badache, Abdelmadjid Bo...