15033 search results - page 351 / 3007 » Complexity Theory and Algorithms |
189
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
206
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
184
click to vote
DCG
2008
15 years 7 months ago
2008
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...
183
click to vote
IJBRA
2007
15 years 7 months ago
2007
: Clustering protein-protein interaction networks (PINs) helps to identify complexes that guide the cell machinery. Clustering algorithms often create a flat clustering, without co...
176
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...