1397 search results - page 256 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
ICANNGA
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Accurate localization of mobile objects is a major research problem in sensor networks and an important data mining application. Specifically, the localization problem is to deter...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— Flooding based strategies are conventionally employed to perform querying and broadcasting in sensor networks. These schemes have low hop-delays of Θ( 1 M(n) ) to reac...