Sciweavers

1380 search results - page 192 / 276
» A General Polynomial Sieve
Sort
View
COMPGEOM
2009
ACM
14 years 3 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
CDC
2008
IEEE
14 years 3 months ago
Noise suppression in auto-regulatory gene networks
— Living cells are characterized by small populations of key molecular components that have large stochastic noise associated with them. Various gene network motifs exists within...
Abhyudai Singh, João Pedro Hespanha
INFOCOM
2008
IEEE
14 years 3 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
FCCM
2007
IEEE
107views VLSI» more  FCCM 2007»
14 years 3 months ago
Optimizing Logarithmic Arithmetic on FPGAs
This paper proposes optimizations of the methods and parameters used in both mathematical approximation and hardware design for logarithmic number system (LNS) arithmetic. First, ...
Haohuan Fu, Oskar Mencer, Wayne Luk