11949 search results - page 2195 / 2390 » Some results on (a:b)-choosability |
167
click to vote
STOC
2000
ACM
15 years 6 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
114
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Most methods for the recognition of shape classes from 3D datasets focus on classifying clean, often manually generated models. However, 3D shapes obtained through acquisition tech...
138
click to vote
CIKM
2000
Springer
15 years 6 months ago
2000
Springer
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
134
click to vote
DEXA
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
101
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...