Sciweavers

2157 search results - page 241 / 432
» Optimal Fast Hashing
Sort
View
229
Voted
BTW
2009
Springer
118views Database» more  BTW 2009»
15 years 6 months ago
Multi-Objective Scheduling for Real-Time Data Warehouses
: The issue of write-read contention is one of the most prevalent problems when deploying real-time data warehouses. With increasing load, updates are increasingly delayed and prev...
Maik Thiele, Andreas Bader, Wolfgang Lehner
110
Voted
AAAI
2008
15 years 5 months ago
From Comparing Clusterings to Combining Clusterings
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
Zhiwu Lu, Yuxin Peng, Jianguo Xiao
124
Voted
NECO
2008
108views more  NECO 2008»
15 years 3 months ago
An SMO Algorithm for the Potential Support Vector Machine
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...
Tilman Knebel, Sepp Hochreiter, Klaus Obermayer
IJON
2007
99views more  IJON 2007»
15 years 3 months ago
A relative trust-region algorithm for independent component analysis
In this paper we present a method of parameter optimization, relative trust-region learning, where the trust-region method and the relative optimization [21] are jointly exploited...
Heeyoul Choi, Seungjin Choi
121
Voted
TPDS
2008
88views more  TPDS 2008»
15 years 3 months ago
A Two-Hop Solution to Solving Topology Mismatch
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
Yunhao Liu