Sciweavers

17688 search results - page 83 / 3538
» Data Set Balancing
Sort
View
ICDCSW
2011
IEEE
14 years 2 months ago
Finding a "Kneedle" in a Haystack: Detecting Knee Points in System Behavior
—Computer systems often reach a point at which the relative cost to increase some tunable parameter is no longer worth the corresponding performance benefit. These “knees” t...
Ville Satopaa, Jeannie R. Albrecht, David Irwin, B...
GI
2003
Springer
15 years 8 months ago
Prozessorientierte Balanced Scorecard als Instrument des IT-Managements
Abstract: Mit Hilfe von speziell auf seine Bedürfnisse zugeschnittene Berichtssysteme kann das IT-Management das interne Prozessmanagement sinnvoll unterstützen. An dem Beispiel ...
Jörg Becker, Ralf Knackstedt, Tobias Rieke
KDD
1998
ACM
166views Data Mining» more  KDD 1998»
15 years 7 months ago
Comparing Massive High-Dimensional Data Sets
Theodore Johnson, Tamraparni Dasu
SBACPAD
2003
IEEE
111views Hardware» more  SBACPAD 2003»
15 years 8 months ago
Boosting Performance for I/O-Intensive Workload by Preemptive Job Migrations in a Cluster System
Load balancing in a cluster system has been investigated extensively, mainly focusing on the effective usage of global CPU and memory resources. However, if a significant portion ...
Xiao Qin, Hong Jiang, Yifeng Zhu, David R. Swanson
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 6 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula