In this paper we introduce a new deformable model, called eigensnake, for segmentation of elongated structures in a probabilistic framework. Instead of snake attraction by speciļ¬...
This paper introduces a family of Ā¢ Ā¢ tensors, referred to as ājoin tensorsā or Jtensors for short, which perform ā3D to 3Dā alignment between coordinate systems of sets...
Existing datacube precompuatation schemes materialize selected datacube tuples on disk, choosing the most beneļ¬cial cuboids (i.e., combinations of dimensions) to materialize giv...
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
We propose the concept of research trails to help web users create and reestablish context across fragmented research processes without requiring them to explicitly structure and ...