1469 search results - page 222 / 294 » Approximate polynomial decomposition |
147
click to vote
DCOSS
2009
Springer
16 years 24 days ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
150
click to vote
COMPGEOM
2009
ACM
16 years 23 days ago
2009
ACM
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...
155
click to vote
INFOCOM
2008
IEEE
16 years 19 days ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
140
click to vote
INFOCOM
2008
IEEE
16 years 19 days ago
2008
IEEE
— Consider the situation in which a decision maker (Actor) has to decide which of several available resources to use in the presence of an adversary (called Controller) that can ...
144
click to vote
FCCM
2007
IEEE
16 years 17 days ago
2007
IEEE
This paper proposes optimizations of the methods and parameters used in both mathematical approximation and hardware design for logarithmic number system (LNS) arithmetic. First, ...