Sciweavers

263 search results - page 52 / 53
» Regret Bounds for Prediction Problems
Sort
View
CSB
2005
IEEE
125views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Discriminative Discovery of Transcription Factor Binding Sites from Location Data
Motivation: The availability of genome-wide location analyses based on chromatin immunoprecipitation (ChIP) data gives a new insight for in silico analysis of transcriptional regu...
Yuji Kawada, Yasubumi Sakakibara
IWQOS
2001
Springer
13 years 12 months ago
Dynamic Core Provisioning for Quantitative Differentiated Service
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
Raymond R.-F. Liao, Andrew T. Campbell
IEEEPACT
1998
IEEE
13 years 11 months ago
Adaptive Scheduling of Computations and Communications on Distributed Memory Systems
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
Mayez A. Al-Mouhamed, Homam Najjari
VLDB
1999
ACM
145views Database» more  VLDB 1999»
13 years 11 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
13 years 11 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...