Sciweavers

6575 search results - page 868 / 1315
» Specializing visualization algorithms
Sort
View
SIGIR
2009
ACM
15 years 10 months ago
Dynamicity vs. effectiveness: studying online clustering for scatter/gather
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
Weimao Ke, Cassidy R. Sugimoto, Javed Mostafa
IPMI
2009
Springer
16 years 5 months ago
Estimation of Inferential Uncertainty in Assessing Expert Segmentation Performance from STAPLE
The evaluation of the quality of segmentations of an image, and the assessment of intra- and inter-expert variability in segmentation performance, has long been recognized as a dic...
Olivier Commowick, Simon K. Warfield
WWW
2004
ACM
16 years 4 months ago
Link fusion: a unified link analysis framework for multi-type interrelated data objects
Web link analysis has proven to be a significant enhancement for quality based web search. Most existing links can be classified into two categories: intra-type links (e.g., web h...
Wensi Xi, Benyu Zhang, Zheng Chen, Yizhou Lu, Shui...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 4 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
ICFP
2008
ACM
16 years 4 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...