5624 search results - page 593 / 1125 » On Conditional Covering Problem |
227
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
186
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
—Fueled by the promises of high spectral efficiency, adaptive OFDMA has attracted enormous research interests over the last decade. The significant capacity gain of adaptive OF...
155
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
193
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
150
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...