Sciweavers

3250 search results - page 167 / 650
» An Algorithm to Solve a Linear Program
Sort
View
EDBT
2008
ACM
160views Database» more  EDBT 2008»
16 years 6 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
CDC
2008
IEEE
148views Control Systems» more  CDC 2008»
16 years 23 days ago
Robust stabilization for arbitrarily switched linear systems with time-varying delays and uncertainties
Abstract— This paper studies the robust stability and stabilization problems for switched linear discrete-time systems. The parameter uncertainties in the system under considerat...
Lixian Zhang, Peng Shi, Michael V. Basin
ICDCN
2010
Springer
16 years 1 months ago
Parallelization of the Lanczos Algorithm on Multi-core Platforms
In this paper, we report our parallel implementations of the Lanczos sparse linear system solving algorithm over large prime fields, on a multi-core platform. We employ several lo...
Souvik Bhattacherjee, Abhijit Das
CVPR
2010
IEEE
16 years 2 months ago
Relaxing the 3L algorithm for an accurate implicit polynomial fitting
This paper presents a novel method to increase the accuracy of linear fitting of implicit polynomials. The proposed method is based on the 3L algorithm philosophy. The novelty l...
Mohammad Rouhani and Angel D. Sappa
173
Voted
LPNMR
2001
Springer
15 years 10 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel