Sciweavers

4306 search results - page 279 / 862
» Timed Testing with TorX
Sort
View
87
Voted
AMC
2004
79views more  AMC 2004»
15 years 1 months ago
Computational experience with exterior point algorithms for the transportation problem
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...
Charalampos Papamanthou, Konstantinos Paparrizos, ...
127
Voted
CCIA
2010
Springer
14 years 8 months ago
An Agent Architecture for Simultaneous Bilateral Negotiations
Abstract. In this paper we introduce an agent architecture for joint action negotiation among several agents in complex environments and with negotiation time bounds. The architect...
Angela Fabregues, Carles Sierra
107
Voted
ICASSP
2010
IEEE
14 years 8 months ago
Robust frequency-based Audio Fingerprinting
Pure frequency-based audio fingerprint systems have the capacity of handling very short fingerprints while being highly robust to perturbations such as additive noise or compressi...
Elsa Dupraz, Gaël Richard
95
Voted
JMLR
2010
115views more  JMLR 2010»
14 years 8 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
112
Voted
JMLR
2010
225views more  JMLR 2010»
14 years 8 months ago
Hartigan's Method: k-means Clustering without Voronoi
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
Matus Telgarsky, Andrea Vattani