Sciweavers

2949 search results - page 469 / 590
» Universal Sparse Modeling
Sort
View
129
Voted
CIKM
2000
Springer
15 years 5 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
93
Voted
CTCS
1989
Springer
15 years 4 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
93
Voted
FODO
1989
Springer
164views Algorithms» more  FODO 1989»
15 years 4 months ago
ITOSS: An Integrated Toolkit For Operating System Security
d Abstract) Michael Rabin Aiken Computation Laboratory Harvard University Cambridge, MA 02138 J. D. Tygar School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213...
Michael O. Rabin, J. D. Tygar
114
Voted
COLT
2006
Springer
15 years 4 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
103
Voted
COLT
2008
Springer
15 years 2 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal