Sciweavers

1369 search results - page 119 / 274
» Lattice computations for random numbers
Sort
View
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
PERCOM
2005
ACM
14 years 8 months ago
Autonomous Localization Method in Wireless Sensor Networks
In wireless sensor networks, localization systems use data from sensors which receive signals from moving targets, measure RSSI, and translate RSSI into the distance between senso...
Yoshikazu Ohta, Masashi Sugano, Masayuki Murata
MOBIHOC
2002
ACM
14 years 8 months ago
Characterizing the interaction between routing and MAC protocols in ad-hoc networks
We empirically study the effect of mobility and interaction between various input parameters on the performance of protocols designed for wireless ad-hoc networks. An important ob...
Christopher L. Barrett, Achla Marathe, Madhav V. M...
ICIP
2007
IEEE
14 years 3 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
ESCIENCE
2006
IEEE
14 years 3 months ago
An Extended Extremal Optimisation Model for Parallel Architectures
: A relatively new meta-heuristic, known as extremal optimisation (EO), is based on the evolutionary science notion that poorly performing genes of an individual are replaced by ra...
Marcus Randall, Andrew Lewis