Sciweavers

1857 search results - page 107 / 372
» Minimum Degree Orderings
Sort
View
NAACL
2010
15 years 4 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
DCC
2006
IEEE
16 years 6 months ago
Generating More MNT Elliptic Curves
In their seminal paper, Miyaji, Nakabayashi and Takano [12] describe a simple method for the creation of elliptic curves of prime order with embedding degree 3, 4, or 6. Such curve...
Michael Scott, Paulo S. L. M. Barreto
CSEE
2009
Springer
16 years 1 months ago
Displacing the Sage on the Stage: Student Control of Learning
Student-centred learning implies an increased degree of responsibility in the learning context by the student, and an equally increased level of delegation by the teacher. This pa...
Jocelyn Armarego
AAECC
1995
Springer
92views Algorithms» more  AAECC 1995»
15 years 10 months ago
Division of Entire Functions by Polynomial Ideals
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
Joachim Apel