2061 search results - page 235 / 413 » The continuous knapsack set |
116
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
108
Voted
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
152
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Scientific data sets continue to increase in both size and complexity. In the past, dedicated graphics systems at supercomputing centers were required to visualize large data sets,...
132
click to vote
TSP
2010
14 years 10 months ago
2010
We present the Recursive Least Squares Dictionary Learning Algorithm, RLSDLA, which can be used for learning overcomplete dictionaries for sparse signal representation. Most Dicti...
129
Voted
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...