Sciweavers

624 search results - page 106 / 125
» Mutant Query Plans
Sort
View
SIGMOD
2004
ACM
100views Database» more  SIGMOD 2004»
14 years 10 months ago
Cost-Based Labeling of Groups of Mass Spectra
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...
Lei Chen 0003, Zheng Huang, Raghu Ramakrishnan
NOMS
2008
IEEE
14 years 4 months ago
Monitoring scheduling for home gateways
— In simple and monolithic systems such as our current home gateways, monitoring is often overlooked: the home user can only reboot the gateway when there is a problem. In next-g...
Stéphane Frénot, Yvan Royon, Pierre ...
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 4 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
DOLAP
2004
ACM
14 years 3 months ago
Developing a characterization of business intelligence workloads for sizing new database systems
Computer system sizing involves estimating the amount of hardware resources needed to support a new workload not yet deployed in a production environment. In order to determine th...
Ted J. Wasserman, Patrick Martin, David B. Skillic...
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
14 years 3 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...