Sciweavers

1004 search results - page 26 / 201
» Product representations of polynomials
Sort
View
KDD
2005
ACM
86views Data Mining» more  KDD 2005»
14 years 7 months ago
Probabilistic workflow mining
In several organizations, it has become increasingly popular to document and log the steps that makeup a typical business process. In some situations, a normative workflow model o...
Ricardo Silva, Jiji Zhang, James G. Shanahan
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
13 years 12 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
JC
2010
117views more  JC 2010»
13 years 2 months ago
Tractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
Anargyros Papageorgiou, Henryk Wozniakowski
SPLC
2004
13 years 8 months ago
A Methodology for the Derivation and Verification of Use Cases for Product Lines
In this paper, we present a methodology to express, in a formal way, the requirements of products belonging to a product line. We relied on a formalism allowing the representation ...
Alessandro Fantechi, Stefania Gnesi, Giuseppe Lami...
ACL
1997
13 years 8 months ago
Integrating Symbolic and Statistical Representations: The Lexicon Pragmatics Interface
We describe a formal framework for interpretation of words and compounds in a discourse context which integrates a symbolic lexicon/grammar, word-sense probabilities, and a pragma...
Ann A. Copestake, Alex Lascarides