Sciweavers

779 search results - page 117 / 156
» A graph polynomial for independent sets of bipartite graphs
Sort
View
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
15 years 10 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
LATIN
2010
Springer
15 years 4 months ago
Some Observations on Holographic Algorithms
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
Leslie G. Valiant
CVIU
2008
192views more  CVIU 2008»
14 years 9 months ago
Content based video matching using spatiotemporal volumes
This paper presents a novel framework for matching video sequences using the spatiotemporal segmentation of videos. Instead of using appearance features for region correspondence ...
Arslan Basharat, Yun Zhai, Mubarak Shah
FOCS
1992
IEEE
15 years 1 months ago
Quadratic Dynamical Systems (Preliminary Version)
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
Yuri Rabinovich, Alistair Sinclair, Avi Wigderson
CLASSIFICATION
2008
68views more  CLASSIFICATION 2008»
14 years 10 months ago
The Metric Cutpoint Partition Problem
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
Alain Hertz, Sacha Varone