1380 search results - page 84 / 276 » A General Polynomial Sieve |
150
click to vote
CASES
2005
ACM
15 years 8 months ago
2005
ACM
Due to resource and power constraints, embedded processors often cannot afford dedicated floating-point units. For instance, the IBM PowerPC processor embedded in Xilinx Virtex-...
167
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
167
click to vote
ICC
2007
IEEE
16 years 16 days ago
2007
IEEE
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
184
click to vote
COCO
1991
Springer
15 years 9 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
129
click to vote
CSDA
2008
15 years 6 months ago
2008
We discuss optimal design problems for a popular method of series estimation in regression problems. Commonly used design criteria are based on the generalized variance of the est...