2168 search results - page 165 / 434 » Randomized Algorithms and Complexity Theory |
146
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
107
Voted
RECSYS
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
124
Voted
IJCAI
1989
15 years 4 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
122
Voted
ESA
2007
Springer
15 years 9 months ago
2007
Springer
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...
175
click to vote
TNN
2010
14 years 10 months ago
2010
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...