Sciweavers

3019 search results - page 61 / 604
» Approximating the Domatic Number
Sort
View
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
15 years 1 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
JSCIC
2008
107views more  JSCIC 2008»
14 years 11 months ago
A Hierarchy of Approximations of the Master Equation Scaled by a Size Parameter
Solutions of the master equation are approximated using a hierarchy of models based on the solution of ordinary differential equations: the macroscopic equations, the linear noise...
Lars Ferm, Per Lötstedt, Andreas Hellander
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 1 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
CSR
2007
Springer
15 years 6 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ACSC
2006
IEEE
15 years 6 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda