Sciweavers

8780 search results - page 1339 / 1756
» On the Feasibility of Consistent Computations
Sort
View
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 7 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
VLSID
2002
IEEE
78views VLSI» more  VLSID 2002»
16 years 7 months ago
Optimization of Test Accesses with a Combined BIST and External Test Scheme
External pins for test are precious hardware resources because this number is strongly restricted. Cores are tested via test access mechanisms (TAMs) such as a test bus architectu...
Makoto Sugihara, Hiroto Yasuura
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 7 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
EDBT
2009
ACM
175views Database» more  EDBT 2009»
16 years 1 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
INFOCOM
2009
IEEE
16 years 1 months ago
On Fast Optimal STDMA Scheduling over Fading Wireless Channels
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
JiaLiang Zhang, Soung Chang Liew, Liqun Fu
« Prev « First page 1339 / 1756 Last » Next »