Sciweavers

6045 search results - page 393 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
16 years 1 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...
IPPS
2002
IEEE
16 years 18 days ago
Detecting Temporal Logic Predicates on the Happened-Before Model
Detection of a global predicate is a fundamental problem in distributed computing. In this paper we describe new predicate detection algorithms for certain temporal logic predicat...
Alper Sen, Vijay K. Garg
ECCV
2010
Springer
16 years 23 hour ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
SIGGRAPH
1999
ACM
15 years 12 months ago
Subdivision Schemes for Fluid Flow
The motion of fluids has been a topic of study for hundredsof years. In its most general setting, fluid flow is governed by a system of non-linear partial differential equation...
Henrik Weimer, Joe D. Warren
IPPS
2010
IEEE
15 years 5 months ago
Tile QR factorization with parallel panel processing for multicore architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
Bilel Hadri, Hatem Ltaief, Emmanuel Agullo, Jack D...