3422 search results - page 659 / 685 » Random Subset Optimization |
115
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
114
click to vote
TCC
2007
Springer
15 years 8 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
157
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
117
click to vote
ICNP
2006
IEEE
15 years 8 months ago
2006
IEEE
— Energy efficiency is widely understood to be one of the dominant considerations for Wireless Sensor Networks. Based on historical data and technology trends, the receiver ener...
144
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...