Sciweavers

7978 search results - page 78 / 1596
» Representation before computation
Sort
View
FCT
2005
Springer
14 years 1 months ago
The Complexity of Semilinear Problems in Succinct Representation
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
Peter Bürgisser, Felipe Cucker, Paulin Jacob&...
CAD
2005
Springer
13 years 7 months ago
Modeling generalized cylinders using direction map representation
For generalized cylinders (GC) defined by contours of discrete curves, we propose two algorithms to generate GC surfaces (1) in polygonal meshes and (2) in cylindrical type of dev...
Joo-Haeng Lee
ICPR
2010
IEEE
14 years 13 days ago
Fingerprint Pore Matching Based on Sparse Representation
—This paper proposes an improved direct fingerprint pore matching method. It measures the differences between pores by using the sparse representation technique. The coarse pore ...
Feng Liu, Qijun Zhao, Lei Zhang, David Zhang
ACL
2006
13 years 9 months ago
An Improved Redundancy Elimination Algorithm for Underspecified Representations
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
Alexander Koller, Stefan Thater
JC
2006
105views more  JC 2006»
13 years 7 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...