Sciweavers

693 search results - page 32 / 139
» Minimization and Partitioning Method Reducing Input Sets
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 1 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ISPAN
1997
IEEE
15 years 5 months ago
A Parallel Pipelined Renderer for Time-Varying Volume Data
This paper presents a strategy for efficiently rendering time-varying volume data on a distributed-memory parallel computer. Visualizing time-varying volume data take both large s...
Tzi-cker Chiueh, Kwan-Liu Ma
SMC
2007
IEEE
110views Control Systems» more  SMC 2007»
15 years 7 months ago
A validity index based on cluster symmetry
— An important consideration in clustering is the determination of the correct number of clusters and the appropriate partitioning of a given data set. In this paper, a newly dev...
Sriparna Saha, Sanghamitra Bandyopadhyay
IPPS
2006
IEEE
15 years 7 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...
SCIA
2011
Springer
341views Image Analysis» more  SCIA 2011»
14 years 4 months ago
Interactive Image Segmentation Using Level Sets and Dempster-Shafer Theory of Evidence
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...
Björn Scheuermann, Bodo Rosenhahn