Sciweavers

91 search results - page 16 / 19
» Bounding the Size of k-Tuple Covers
Sort
View
COLT
2005
Springer
15 years 3 months ago
A PAC-Style Model for Learning from Labeled and Unlabeled Data
Abstract. There has been growing interest in practice in using unlabeled data together with labeled data in machine learning, and a number of different approaches have been develo...
Maria-Florina Balcan, Avrim Blum
HIPEAC
2005
Springer
15 years 3 months ago
Enhancing Network Processor Simulation Speed with Statistical Input Sampling
Abstract. While cycle-accurate simulation tools have been widely used in modeling high-performance processors, such an approach can be hindered by the increasing complexity of the ...
Jia Yu, Jun Yang 0002, Shaojie Chen, Yan Luo, Laxm...
SEMWEB
2005
Springer
15 years 3 months ago
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
Herman J. ter Horst
ISPD
2000
ACM
126views Hardware» more  ISPD 2000»
15 years 2 months ago
A practical clock tree synthesis for semi-synchronous circuits
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such ...
Masahiko Toyonaga, Keiichi Kurokawa, Takuya Yasui,...
COCOA
2008
Springer
14 years 11 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth