7006 search results - page 336 / 1402 » Approximation Algorithms |
114
click to vote
TALG
2008
15 years 4 months ago
2008
In this paper, we study the metrics of negative type, which are metrics (V, d) such that d is an Euclidean metric; these metrics are thus also known as " 2-squared" met...
138
click to vote
TFS
2008
15 years 2 months ago
2008
Some errors in our original paper in defining relative reduct with information measures are pointed out in this paper. It is shown that in our original work, Theorems 10 and 19 hol...
223
Voted
ORL
2011
14 years 10 months ago
2011
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
129
Voted
CONIELECOMP
2005
IEEE
15 years 9 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
179
click to vote
AAAI
2010
15 years 5 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...