5115 search results - page 926 / 1023 » On Randomized Lanczos Algorithms |
142
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
166
click to vote
MOBIHOC
2005
ACM
16 years 5 months ago
2005
ACM
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
149
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
142
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
165
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...