7930 search results - page 474 / 1586 » Greedy in Approximation Algorithms |
229
click to vote
AAAI
2010
15 years 8 months ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
203
click to vote
ECIR
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
109
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
The eigenvalue decomposition (EVD) of a Hermitian matrix in terms of unitary matrices is well known. In this paper, we present an algorithm for the approximate EVD (AEVD) of a par...
188
Voted
CAD
2006
Springer
15 years 7 months ago
2006
Springer
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone sp...
207
click to vote
TCS
2008
15 years 6 months ago
2008
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...