179 search results - page 24 / 36 » Active learning in very large databases |
100
click to vote
ICCV
2001
IEEE
16 years 1 months ago
2001
IEEE
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
120
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
108
click to vote
ICDE
2010
IEEE
15 years 3 months ago
2010
IEEE
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
JIIS
2002
14 years 11 months ago
2002
Advances in image acquisition and storage technology have led to tremendous growth in very large and detailed image databases. These images, if analyzed, can reveal useful informa...
119
click to vote
EXPDB
2006
ACM
15 years 5 months ago
2006
ACM
In data warehousing applications, the ability to efficiently delete large chunks of data from a table is very important. This feature is also known as Rollout. Rollout is generall...