13841 search results - page 2165 / 2769 » Algorithms and Constraint Programming |
254
click to vote
ICALP
2011
Springer
14 years 11 months ago
2011
Springer
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
201
Voted
CIKM
2011
Springer
14 years 7 months ago
2011
Springer
Previous information extraction (IE) systems are typically organized as a pipeline architecture of separated stages which make independent local decisions. When the data grows bey...
200
click to vote
JMLR
2012
13 years 10 months ago
2012
We develop a new tool for data-dependent analysis of the exploration-exploitation trade-off in learning under limited feedback. Our tool is based on two main ingredients. The fi...
268
Voted
JMLR
2012
13 years 10 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
217
click to vote
JMLR
2012
13 years 10 months ago
2012
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...