Sciweavers

3223 search results - page 546 / 645
» The Scaling of Search Cost
Sort
View
WINET
2010
128views more  WINET 2010»
13 years 6 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
4OR
2010
148views more  4OR 2010»
13 years 6 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
ICIP
2010
IEEE
13 years 6 months ago
Fast bilateral filtering by adapting block size
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
PKDD
2010
Springer
125views Data Mining» more  PKDD 2010»
13 years 6 months ago
NDPMine: Efficiently Mining Discriminative Numerical Features for Pattern-Based Classification
Abstract. Pattern-based classification has demonstrated its power in recent studies, but because the cost of mining discriminative patterns as features in classification is very ex...
Hyungsul Kim, Sangkyum Kim, Tim Weninger, Jiawei H...
ADBIS
2009
Springer
135views Database» more  ADBIS 2009»
13 years 6 months ago
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Mat...