1289 search results - page 3 / 258 » Complexity of Counting the Optimal Solutions |
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
ICDT
2009
ACM
14 years 10 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
ECCV
2010
Springer
14 years 3 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...
CASES
2006
ACM
14 years 3 months ago
2006
ACM
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...