Sciweavers

5055 search results - page 273 / 1011
» Relative Timing
Sort
View
ICALP
2004
Springer
16 years 13 days ago
A Note on Karr's Algorithm
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
Markus Müller-Olm, Helmut Seidl
AINA
2003
IEEE
16 years 11 days ago
Analysis of Delayed Reservation Scheme in Server-Based QoS Management Network
This paper proposes an analytical model for delayed reservation scheme, which can be exactly analyzed. By applying it to a server-based QoS management network, we can obtain the r...
Takeshi Ikenaga, Kenji Kawahara, Tetsuya Takine, Y...
MSS
1999
IEEE
115views Hardware» more  MSS 1999»
15 years 11 months ago
Managing Databases with Binary Large Objects
We present recommendations on Performance Management for databases supporting Binary Large Objects (BLOB) that, under a wide range of conditions, save both storage space and datab...
Michael Shapiro, Ethan L. Miller
ICDM
2008
IEEE
190views Data Mining» more  ICDM 2008»
16 years 1 months ago
Simultaneous Co-segmentation and Predictive Modeling for Large, Temporal Marketing Data
Several marketing problems involve prediction of customer purchase behavior and forecasting future preferences. We consider predictive modeling of large scale, bi-modal or multimo...
Meghana Deodhar, Joydeep Ghosh
ECEASST
2008
84views more  ECEASST 2008»
15 years 6 months ago
An Incremental OCL Compiler for Modeling Environments
In software engineering, reliability and development time are two of the most important aspects, therefore, modeling environments, which aide both, are widely used during software ...
Tamás Vajk, Gergely Mezei, Tihamer Levendov...