6110 search results - page 320 / 1222 » Approximate Computing |
175
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
175
Voted
JELIA
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
195
click to vote
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
195
click to vote
DEXA
2008
Springer
15 years 8 months ago
2008
Springer
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
183
click to vote
TCSV
2008
15 years 6 months ago
2008
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...