2168 search results - page 371 / 434 » Randomized Algorithms and Complexity Theory |
178
click to vote
JMLR
2010
14 years 9 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
160
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
211
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
141
click to vote
MOBIHOC
2004
ACM
15 years 8 months ago
2004
ACM
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...
142
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...