Sciweavers

3934 search results - page 780 / 787
» Approximate Schedulability Analysis
Sort
View
SADM
2010
128views more  SADM 2010»
13 years 5 months ago
Online training on a budget of support vector machines using twin prototypes
: This paper proposes twin prototype support vector machine (TVM), a constant space and sublinear time support vector machine (SVM) algorithm for online learning. TVM achieves its ...
Zhuang Wang, Slobodan Vucetic
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
13 years 5 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 5 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
SIAMJO
2010
246views more  SIAMJO 2010»
13 years 5 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
TKDE
2010
148views more  TKDE 2010»
13 years 5 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang