Sciweavers

449 search results - page 56 / 90
» More than just shape: a representation for functionality
Sort
View
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 9 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
BTW
2003
Springer
118views Database» more  BTW 2003»
14 years 2 months ago
Information System Architectures: From Art to Science
: The presentation claims that architectural design plays a crucial role in system development as a first step in a process that turns a requirements specification into a working s...
Peter C. Lockemann
CGF
2010
120views more  CGF 2010»
13 years 9 months ago
Polygonal mesh watermarking using Laplacian coordinates
We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x,y...
Ying Yang, Ioannis P. Ivrissimtzis
EACL
1993
ACL Anthology
13 years 10 months ago
A Tradeoff between Compositionality and Complexity in the Semantics of Dimensional Adjectives
Linguistic access to uncertain quantitative knowledge about physical properties is provided by dimensional adjectives, e.g. long-short in the spatial and temporal senses, near-far...
Geoffrey Simmons
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 1 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook