Sciweavers

6045 search results - page 71 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
IPPS
1999
IEEE
14 years 4 days ago
Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus...
Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Va...
ISCI
1998
193views more  ISCI 1998»
13 years 7 months ago
A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
David Andre, John R. Koza
FOCS
2010
IEEE
13 years 5 months ago
Solving Linear Systems through Nested Dissection
Abstract--The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax = b where A is a symmetric positive de...
Noga Alon, Raphael Yuster
NAACL
2010
13 years 5 months ago
Softmax-Margin CRFs: Training Log-Linear Models with Cost Functions
We describe a method of incorporating taskspecific cost functions into standard conditional log-likelihood (CLL) training of linear structured prediction models. Recently introduc...
Kevin Gimpel, Noah A. Smith
ACL
2009
13 years 5 months ago
Non-Projective Dependency Parsing in Expected Linear Time
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
Joakim Nivre