Sciweavers

860 search results - page 26 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
IEEEINTERACT
2002
IEEE
14 years 18 days ago
On the Predictability of Program Behavior Using Different Input Data Sets
Smaller input data sets such as the test and the train input sets are commonly used in simulation to estimate the impact of architecture/micro-architecture features on the perform...
Wei-Chung Hsu, Howard Chen, Pen-Chung Yew, Dong-yu...
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 7 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
COLT
2008
Springer
13 years 9 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
GLOBECOM
2010
IEEE
13 years 5 months ago
Multicast Advance Reservation RWA Heuristics in Wavelength-Routed Networks
In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Advance reservation connection requests specify ...
Neal Charbonneau, Vinod Vokkarane
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
13 years 7 months ago
New Bounds for Codes Identifying Vertices in Graphs
Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...
Gérard D. Cohen, Iiro S. Honkala, Antoine L...