Sciweavers

1380 search results - page 103 / 276
» A General Polynomial Sieve
Sort
View
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
12 years 6 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
14 years 11 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
ISCAS
1993
IEEE
105views Hardware» more  ISCAS 1993»
14 years 3 months ago
Maximally flat FIR filters
The existence of nonsymmetric generalized half-band lowpass and highpass FIR filters with maximally flat magnitude and group delay characteristics is proved. Like their linear-p...
Todor Cooklev, Akinori Nishihara
JCT
2010
94views more  JCT 2010»
13 years 9 months ago
Growth diagrams for the Schubert multiplication
We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Sch¨utzenberger’s jeu de taquin....
Cristian Lenart
ICCV
2003
IEEE
15 years 1 months ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah