Sciweavers

757 search results - page 117 / 152
» How to decide
Sort
View
ICC
2011
IEEE
201views Communications» more  ICC 2011»
12 years 7 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
ICDM
2009
IEEE
164views Data Mining» more  ICDM 2009»
14 years 2 months ago
iTopicModel: Information Network-Integrated Topic Modeling
—Document networks, i.e., networks associated with text information, are becoming increasingly popular due to the ubiquity of Web documents, blogs, and various kinds of online da...
Yizhou Sun, Jiawei Han, Jing Gao, Yintao Yu
STACS
2010
Springer
14 years 2 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen
DAC
2012
ACM
11 years 10 months ago
Cache revive: architecting volatile STT-RAM caches for enhanced performance in CMPs
Spin-Transfer Torque RAM (STT-RAM) is an emerging non-volatile memory (NVM) technology that has the potential to replace the conventional on-chip SRAM caches for designing a more ...
Adwait Jog, Asit K. Mishra, Cong Xu, Yuan Xie, Vij...
ICDCS
2010
IEEE
13 years 11 months ago
Stochastic Steepest-Descent Optimization of Multiple-Objective Mobile Sensor Coverage
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...