2766 search results - page 320 / 554 » Algorithms for trigonometric polynomials |
127
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 ...
140
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Rich representations in reinforcement learning have been studied for the purpose of enabling generalization and making learning feasible in large state spaces. We introduce Object...
133
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
135
Voted
STOC
2002
ACM
16 years 5 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
154
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...