91 search results - page 16 / 19 » Bounding the Size of k-Tuple Covers |
106
Voted
COLT
2005
Springer
15 years 7 months ago
2005
Springer
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...
111
click to vote
HIPEAC
2005
Springer
15 years 7 months ago
2005
Springer
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 ...
95
Voted
SEMWEB
2005
Springer
15 years 7 months ago
2005
Springer
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...
110
click to vote
ISPD
2000
ACM
15 years 6 months ago
2000
ACM
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 ...
105
click to vote
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
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...