Sciweavers

843 search results - page 126 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
MONET
2006
107views more  MONET 2006»
13 years 7 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao
INFOCOM
2010
IEEE
13 years 5 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Craig W. Cameron, Steven H. Low, David X. Wei
GECCO
2003
Springer
14 years 18 days ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
SIGMOD
2008
ACM
210views Database» more  SIGMOD 2008»
14 years 7 months ago
Private queries in location based services: anonymizers are not necessary
Mobile devices equipped with positioning capabilities (e.g., GPS) can ask location-dependent queries to Location Based Services (LBS). To protect privacy, the user location must n...
Gabriel Ghinita, Panos Kalnis, Ali Khoshgozaran, C...