Sciweavers

900 search results - page 30 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 9 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
CSB
2005
IEEE
136views Bioinformatics» more  CSB 2005»
14 years 2 months ago
An Algebraic Geometry Approach to Protein Structure Determination from NMR Data
Our paper describes the first provably-efficient algorithm for determining protein structures de novo, solely from experimental data. We show how the global nature of a certain ...
Lincong Wang, Ramgopal R. Mettu, Bruce Randall Don...
WWW
2002
ACM
14 years 9 months ago
Multimedia meets computer graphics in SMIL2.0: a time model for the web
Multimedia scheduling models provide a rich variety of tools for managing the synchronization of media like video and audio, but generally have an inflexible model for time itself...
Patrick Schmitz
ISTCS
1993
Springer
14 years 1 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag
ISCAS
2003
IEEE
172views Hardware» more  ISCAS 2003»
14 years 2 months ago
Efficient symbol synchronization techniques using variable FIR or IIR interpolation filters
Maximum Likelihood estimation theory can be used to develop optimal timing recovery schemes for digital communication systems. Tunable digital interpolation filters are commonly ...
Martin Makundi, Timo I. Laakso