Sciweavers

627 search results - page 41 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
MICCAI
2009
Springer
16 years 3 months ago
Fast Automatic Segmentation of the Esophagus from 3D CT Data Using a Probabilistic Model
Automated segmentation of the esophagus in CT images is of high value to radiologists for oncological examinations of the mediastinum. It can serve as a guideline and prevent confu...
Johannes Feulner, Shaohua Kevin Zhou, Alexander Ca...
TKDE
2008
178views more  TKDE 2008»
15 years 6 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 6 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
ICDE
2009
IEEE
160views Database» more  ICDE 2009»
15 years 3 months ago
Perm: Processing Provenance and Data on the Same Data Model through Query Rewriting
Data provenance is information that describes how a given data item was produced. The provenance includes source and intermediate data as well as the transformations involved in pr...
Boris Glavic, Gustavo Alonso
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
15 years 6 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan