36 search results - page 2 / 8 » The Query Complexity of Finding Local Minima in the Lattice |
TSP
2008
14 years 11 months ago
2008
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
100
click to vote
STOC
2004
ACM
15 years 11 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
ICASSP
2008
IEEE
15 years 5 months ago
2008
IEEE
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
WWW
2008
ACM
14 years 11 months ago
2008
ACM
A geographic search request contains a query consisting of one or more keywords, and a search-location that the user searches for. In this paper, we study the problem of discoveri...
INFOCOM
2008
IEEE
15 years 5 months ago
2008
IEEE
—We study the problem of data-driven routing and navigation in a distributed sensor network over a continuous scalar field. Specifically, we address the problem of searching fo...