4674 search results - page 176 / 935 » cases 2008 |
179
click to vote
CCCG
2008
15 years 7 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
154
click to vote
CCCG
2008
15 years 7 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
212
click to vote
COLING
2008
15 years 7 months ago
2008
We present an approach to ontology population based on a lexical substitution technique. It consists in estimating the plausibility of sentences where the named entity to be class...
172
click to vote
DATESO
2008
15 years 7 months ago
2008
Matrix factorization or factor analysis is an important task helpful in the analysis of high dimensional real world data. There are several well known methods and algorithms for fa...
172
click to vote
DLT
2008
15 years 7 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...