1322 search results - page 95 / 265 » Parameterized counting problems |
130
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
127
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
137
click to vote
ASPDAC
2009
ACM
15 years 8 months ago
2009
ACM
The number of vias generated during the global routing stage is a critical factor for the yield of final circuits. However, most global routers only approach the problem by chargin...
136
click to vote
DAWAK
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
140
click to vote
ACL
1994
15 years 5 months ago
1994
An automatic compound retrieval method is proposed to extract compounds within a text message. It uses n-gram mutual information, relative frequency count and parts of speech as t...