Sciweavers

1242 search results - page 166 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
14 years 10 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
RAS
2002
105views more  RAS 2002»
14 years 9 months ago
Visually guided manipulation tasks
In this paper, we present a framework for a robotic system with the ability to perform real-world manipulation tasks. The complexity of such tasks determines the precision and fre...
Danica Kragic, Lars Petersson, Henrik I. Christens...
PE
2007
Springer
112views Optimization» more  PE 2007»
14 years 9 months ago
Multicast inference of temporal loss characteristics
Multicast-based inference has been proposed as a method of estimating average loss rates of internal network links, using end-to-end loss measurements of probes sent over a multic...
Vijay Arya, Nick G. Duffield, Darryl Veitch
ISOLA
2010
Springer
14 years 8 months ago
Towards a Connector Algebra
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The Connect ...
Marco Autili, Chris Chilton, Paola Inverardi, Mart...
MST
2010
140views more  MST 2010»
14 years 8 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh