1419 search results - page 58 / 284 » Searching for Related Objects in Relational Databases |
240
Voted
ICDE
2001
IEEE
16 years 5 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
96
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we present the results of parallelizing two life sciences applications, Markov random fieldsbased (MRF) liver segmentation and HMMER’s Viterbi algorithm, using GP...
147
Voted
IJBRA
2008
15 years 3 months ago
2008
: Fast and accurate 3D object reconstruction and partial 3D component retrieval from 2D image slices represent a difficult and challenging problem. To group related objects on diff...
130
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
We present some theoretical results related to the problem
of actively searching for a target in a 3D environment,
under the constraint of a maximum search time. We define
the o...
160
click to vote
SIGMOD
2010
ACM
14 years 10 months ago
2010
ACM
Result diversification has recently attracted much attention as a means of increasing user satisfaction in recommender systems and web search. Many different approaches have been ...