Sciweavers

5624 search results - page 865 / 1125
» On Conditional Covering Problem
Sort
View
INFOCOM
1998
IEEE
15 years 7 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
ICCAD
1997
IEEE
122views Hardware» more  ICCAD 1997»
15 years 7 months ago
Approximate timing analysis of combinational circuits under the XBD0 model
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
Yuji Kukimoto, Wilsin Gosti, Alexander Saldanha, R...
VLDB
1998
ACM
147views Database» more  VLDB 1998»
15 years 7 months ago
Scalable Techniques for Mining Causal Structures
Mining for association rules in market basket data has proved a fruitful areaof research. Measures such as conditional probability (confidence) and correlation have been used to i...
Craig Silverstein, Sergey Brin, Rajeev Motwani, Je...
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 6 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...
COLT
2008
Springer
15 years 5 months ago
Adaptive Hausdorff Estimation of Density Level Sets
Consider the problem of estimating the -level set G = {x : f(x) } of an unknown d-dimensional density function f based on n independent observations X1, . . . , Xn from the densi...
Aarti Singh, Robert Nowak, Clayton Scott