Sciweavers

1518 search results - page 71 / 304
» Exact and Approximate Bandwidth
Sort
View
ISPD
1998
ACM
107views Hardware» more  ISPD 1998»
15 years 2 months ago
Sequence-pair based placement method for hard/soft/pre-placed modules
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
Hiroshi Murata, Ernest S. Kuh
ACL
2008
14 years 11 months ago
Forest Reranking: Discriminative Parsing with Non-Local Features
Conventional n-best reranking techniques often suffer from the limited scope of the nbest list, which rules out many potentially good alternatives. We instead propose forest reran...
Liang Huang
JSCIC
2007
377views more  JSCIC 2007»
14 years 9 months ago
A Note on Discontinuous Galerkin Divergence-free Solutions of the Navier-Stokes Equations
We present a class of discontinuous Galerkin methods for the incompressible Navier-Stokes equations yielding exactly divergence-free solutions. Exact incompressibility is achieved...
Bernardo Cockburn, Guido Kanschat, Dominik Sch&oum...
ATAL
2008
Springer
14 years 11 months ago
Approximate predictive state representations
Predictive state representations (PSRs) are models that represent the state of a dynamical system as a set of predictions about future events. The existing work with PSRs focuses ...
Britton Wolfe, Michael R. James, Satinder P. Singh
GBRPR
2005
Springer
15 years 3 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli