Sciweavers

1408 search results - page 60 / 282
» Dynamical Tensor Approximation
Sort
View
POLICY
2005
Springer
14 years 3 months ago
Approximating Service Utility from Policies and Value Function Patterns
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
Steffen Lamparter, Daniel Oberle, Andreas Eberhart
AMCS
2008
124views Mathematics» more  AMCS 2008»
13 years 10 months ago
Approximate Controllability of Infinite Dimensional Systems of the n-th Order
The objective of the article is to obtain general conditions for several types of controllability at once for an abstract differential equation of arbitrary order, instead of condi...
Jerzy Stefan Respondek
TOG
2008
120views more  TOG 2008»
13 years 9 months ago
Real-time, all-frequency shadows in dynamic scenes
Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...
Thomas Annen, Zhao Dong, Tom Mertens, Philippe Bek...
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
14 years 4 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
ICML
2006
IEEE
14 years 10 months ago
Dynamic topic models
A family of probabilistic time series models is developed to analyze the time evolution of topics in large document collections. The approach is to use state space models on the n...
David M. Blei, John D. Lafferty