2223 search results - page 99 / 445 » Ontological Framework for Approximation |
164
Voted
PAKDD
2009
ACM
16 years 2 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
134
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
131
click to vote
ICAC
2007
IEEE
15 years 11 months ago
2007
IEEE
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
152
click to vote
ACL
2010
15 years 3 months ago
2010
We present a novel framework for automated extraction and approximation of numerical object attributes such as height and weight from the Web. Given an object-attribute pair, we d...
128
Voted
STOC
1995
ACM
15 years 8 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...