1552 search results - page 228 / 311 » On the Complexity of Constant Propagation |
199
click to vote
ALT
2002
Springer
16 years 3 months ago
2002
Springer
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
165
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
179
click to vote
CHI
2009
ACM
16 years 1 months ago
2009
ACM
Visualisations of dynamic data change in appearance over time, reflecting changes in the underlying data, be that the development of a social network, or the addition or removal o...
171
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
176
click to vote
WSOM
2009
Springer
16 years 1 months ago
2009
Springer
We propose Merge Growing Neural Gas (MGNG) as a novel unsupervised growing neural network for time series analysis. MGNG combines the state-of-the-art recursive temporal context of...