128 search results - page 7 / 26 » Tractable Cover Compilations |
100
click to vote
IJHPCA
2007
15 years 11 days ago
2007
We describe the rationale behind the design of key features of Titanium—an explicitly parallel dialect of JavaTM for high-performance scientific programming—and our experienc...
69
Voted
AMAST
2006
Springer
15 years 4 months ago
2006
Springer
Programs written in point-free form express computation purely in terms of functions. Such programs are especially amenable to local transformation. In this paper, we describe a pr...
109
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Cr...
94
Voted
FAW
2008
Springer
15 years 2 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
106
Voted
ORDER
2006
15 years 11 days ago
2006
We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders a...