Sciweavers

1170 search results - page 140 / 234
» How Fast Is Too Fast
Sort
View
130
Voted
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 9 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
15 years 9 months ago
Online Hierarchical Clustering in a Data Warehouse Environment
Many important industrial applications rely on data mining methods to uncover patterns and trends in large data warehouse environments. Since a data warehouse is typically updated...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
WETICE
2005
IEEE
15 years 9 months ago
Data access optimization on grid systems
— The execution of data intensive grid applications still raises several questions regarding job scheduling, data migration and replication. The optimization techniques applied b...
László Csaba Lorincz, Tamás K...
FPL
2004
Springer
205views Hardware» more  FPL 2004»
15 years 8 months ago
A System Level Resource Estimation Tool for FPGAs
Abstract. High level modeling tools make it possible to synthesize a high performance FPGA design directly from a Simulink model. Accurate estimates of the FPGA resources required ...
Changchun Shi, James Hwang, Scott McMillan, Ann Ro...
ICCV
2003
IEEE
15 years 8 months ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
Paul Smith, Tom Drummond, Kimon Roussopoulos