4378 search results - page 160 / 876 » On the Complexity of Ordered Colourings |
229
click to vote
ICFP
2012
ACM
13 years 9 months ago
2012
ACM
Most complex software projects are compiled using a build tool (e.g. make), which runs commands in an order satisfying userdefined dependencies. Unfortunately, most build tools r...
209
click to vote
MOC
1998
15 years 6 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
162
click to vote
ESANN
2006
15 years 8 months ago
2006
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...
193
click to vote
CGF
1999
15 years 6 months ago
1999
This paper describes a new algorithm that employs image-based rendering for fast occlusion culling in complex urban environments. It exploits graphics hardware to render and autom...
175
click to vote
LATIN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...