Sciweavers

504 search results - page 13 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
ISSAC
2009
Springer
139views Mathematics» more  ISSAC 2009»
14 years 4 months ago
Multihomogeneous resultant formulae for systems with scaled support
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [7, 14, 16]. We generalize these constructions to mixed systems, whose Ne...
Ioannis Z. Emiris, Angelos Mantzaflaris
ECWEB
2009
Springer
204views ECommerce» more  ECWEB 2009»
14 years 4 months ago
Computational Complexity Reduction for Factorization-Based Collaborative Filtering Algorithms
Abstract. Alternating least squares (ALS) is a powerful matrix factorization (MF) algorithm for both implicit and explicit feedback based recommender systems. We show that by using...
István Pilászy, Domonkos Tikk
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
14 years 3 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx
ICWE
2005
Springer
14 years 3 months ago
The Role of Visual Tools in a Web Application Design and Verification Framework: A Visual Notation for LTL Formulae
As the Web becomes a platform for implementing complex B2C and B2B applications, there is a need to extend Web conceptual modeling to process-centric applications. In this context,...
Marco Brambilla, Alin Deutsch, Liying Sui, Victor ...
FMICS
2006
Springer
14 years 1 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang