Sciweavers

2124 search results - page 278 / 425
» Aggregating time partitions
Sort
View
WWW
2008
ACM
16 years 7 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
16 years 6 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
16 years 6 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
DCC
2005
IEEE
16 years 5 months ago
The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
Harri Haanpää, Petteri Kaski
ICCD
2004
IEEE
112views Hardware» more  ICCD 2004»
16 years 3 months ago
Reducing Issue Queue Power for Multimedia Applications using a Feedback Control Algorithm
In this work, we propose a dynamic power-aware issue queue in a general-purpose microprocessor for multimedia applications. Its resources can be adapted at runtime in accordance w...
Yu Bai, R. Iris Bahar