Sciweavers

279 search results - page 21 / 56
» Matching Polynomials And Duality
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 6 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
13 years 11 months ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 9 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
APBC
2007
110views Bioinformatics» more  APBC 2007»
13 years 9 months ago
Fast Structural Similarity Search Based on Topology String Matching
ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
Sung-Hee Park, David Gilbert, Keun Ho Ryu
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 9 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...