Sciweavers

793 search results - page 39 / 159
» Efficient computation of the characteristic polynomial
Sort
View
CIDM
2007
IEEE
13 years 11 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ISIM
2007
13 years 9 months ago
Transformations from EDOC to EJB by Composition of Mapping Operations
Transformations from the Enterprise Distributed Object Computing (EDOC) to Enterprise JavaBeans (EJB) are examined herein from the point of view of an efficiency characteristic of ...
Dariusz Gall
ICPR
2008
IEEE
14 years 8 months ago
Vector field resampling using local streamline approximation
In this paper, we propose an algorithm to resample coarse vector fields in order to obtain vector fields of a higher density. Unlike the typical linear interpolation scheme, our a...
Mani Thomas, Chandra Kambhamettu, Cathleen A. Geig...
RSA
2010
98views more  RSA 2010»
13 years 6 months ago
Network delay inference from additive metrics
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
Shankar Bhamidi, Ram Rajagopal, Sébastien R...
COLT
2006
Springer
13 years 11 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans