Sciweavers

119 search results - page 11 / 24
» A practical evaluation of popular volume rendering algorithm...
Sort
View
72
Voted
CEC
2007
IEEE
15 years 4 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
SIGECOM
2004
ACM
115views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Limited reputation sharing in P2P systems
The increasing popularity of resource exchange through peerto-peer networks has encouraged the development of ways to support more complex commercial transactions over these netwo...
Sergio Marti, Hector Garcia-Molina
IPPS
2003
IEEE
15 years 3 months ago
A Compilation Framework for Distributed Memory Parallelization of Data Mining Algorithms
With the availability of large datasets in a variety of scientific and commercial domains, data mining has emerged as an important area within the last decade. Data mining techni...
Xiaogang Li, Ruoming Jin, Gagan Agrawal
73
Voted
ACMICEC
2004
ACM
162views ECommerce» more  ACMICEC 2004»
15 years 3 months ago
Balanced matching of buyers and sellers in e-marketplaces: the barter trade exchange model
In this paper, we describe the operation of barter trade exchanges by identifying key techniques used by trade brokers to stimulate trade and satisfy member needs, and present alg...
Peter Haddawy, Namthip Rujikeadkumjorn, Khaimook D...
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
15 years 1 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina