Sciweavers

1439 search results - page 84 / 288
» Fast approximation of centrality
Sort
View
PATMOS
2007
Springer
15 years 4 months ago
Fast Calculation of Permissible Slowdown Factors for Hard Real-Time Systems
This work deals with the problem to optimise the energy consumption of an embedded system. On system level, tasks are assumed to have a certain CPU-usage they need for completion. ...
Henrik Lipskoch, Karsten Albers, Frank Slomka
SPIRE
2007
Springer
15 years 4 months ago
A Fast and Compact Web Graph Representation
Compressed graphs representation has become an attractive research topic because of its applications to the manipulation of huge Web graphs in main memory. By far the best current ...
Francisco Claude, Gonzalo Navarro
3DPVT
2006
IEEE
189views Visualization» more  3DPVT 2006»
15 years 4 months ago
Fast Safe Spline Surrogates for Large Point Clouds
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...
Ashish Myles, Jörg Peters
ICANN
2003
Springer
15 years 3 months ago
Meta-learning for Fast Incremental Learning
Model based learning systems usually face to a problem of forgetting as a result of the incremental learning of new instances. Normally, the systems have to re-learn past instances...
Takayuki Oohira, Koichiro Yamauchi, Takashi Omori
EVOW
2006
Springer
15 years 1 months ago
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
Yuichi Nagata