Sciweavers

5448 search results - page 209 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
SDM
2009
SIAM
343views Data Mining» more  SDM 2009»
16 years 1 months ago
Change-Point Detection in Time-Series Data by Direct Density-Ratio Estimation.
Change-point detection is the problem of discovering time points at which properties of time-series data change. This covers a broad range of real-world problems and has been acti...
Masashi Sugiyama, Yoshinobu Kawahara
WCNC
2010
IEEE
15 years 2 months ago
Sensing and Communication Tradeoff for Cognitive Access of Continues-Time Markov Channels
—Dynamic spectrum access (DSA) aims to improve spectrum efficiency via spectrum sensing and optimal spectrum access. An essential component in DSA is the joint design of sensing...
Xin Li, Qianchuan Zhao, Xiaohong Guan, Lang Tong
COCO
2005
Springer
153views Algorithms» more  COCO 2005»
15 years 10 months ago
Average-Case Computations - Comparing AvgP, HP, and Nearly-P
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
Arfst Nickelsen, Birgit Schelm
CLUSTER
2005
IEEE
15 years 10 months ago
VioCluster: Virtualization for Dynamic Computational Domains
A large organization, such as a university, commonly supplies computational power through multiple independently administered computational domains (e.g. clusters). Each computati...
Paul Ruth, P. McGachey, Dongyan Xu
CLUSTER
2003
IEEE
15 years 9 months ago
Interstitial Computing: Utilizing Spare Cycles on Supercomputers
This paper presents an analysis of utilizing unused cycles on supercomputers through the use of many small jobs. What we call “interstitial computing,” is important to superco...
Stephen D. Kleban, Scott H. Clearwater