Sciweavers

6274 search results - page 388 / 1255
» From query complexity to computational complexity
Sort
View
CCCG
2010
15 years 8 months ago
On degeneracy of lower envelopes of algebraic surfaces
We analyze degeneracy of lower envelopes of algebraic surfaces. We focus on the cases omitted in the existing complexity analysis of lower envelopes [Halperin and Sharir 1993], an...
Kimikazu Kato
ANLP
2000
91views more  ANLP 2000»
15 years 8 months ago
Finite-State Reduplication in One-Level Prosodic Morphology
Reduplication, a central instance of prosodic morphology, is particularly challenging for state-ofthe-art computational morphology, since it involves copying of some part of a pho...
Markus Walther
DAGM
2009
Springer
15 years 10 months ago
An Efficient Linear Method for the Estimation of Ego-Motion from Optical Flow
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
Florian Raudies, Heiko Neumann
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 7 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
PLDI
2005
ACM
16 years 10 days ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...