815 search results - page 105 / 163 » Approximate Entropy Reducts |
MMAS
2010
Springer
14 years 6 months ago
2010
Springer
We present a formal procedure for structure-preserving model reduction of linear second-order and Hamiltonian control problems that appear in a variety of physical contexts, e.g., ...
142
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
111
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
177
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
In this paper we introduce the idea of snapshot queries for energy efficient data acquisition in sensor networks. Network nodes generate models of their surrounding environment th...
ICML
2006
IEEE
16 years 20 days ago
2006
IEEE
In many applications, unlabelled examples are inexpensive and easy to obtain. Semisupervised approaches try to utilise such examples to reduce the predictive error. In this paper,...