2569 search results - page 89 / 514 » Approximate Objects and Approximate Theories |
196
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
164
click to vote
DASFAA
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
156
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
147
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
171
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...