1368 search results - page 136 / 274 » Generalized Rook Polynomials |
162
Voted
SIGMOD
2012
ACM
13 years 7 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
176
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
124
click to vote
ICIP
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper, we present a new framework to compress the geometry of images. This framework generalizes the standard quad partitioning approaches in compression of image geometry ...
228
Voted
WIA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
152
Voted
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...