Sciweavers

2168 search results - page 83 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
127
Voted
BTW
2005
Springer
80views Database» more  BTW 2005»
15 years 9 months ago
Measuring the Quality of Approximated Clusterings
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
Hans-Peter Kriegel, Martin Pfeifle
151
Voted
IPPS
2003
IEEE
15 years 9 months ago
An Object Oriented Framework for an Associative Model of Parallel Computation
An object oriented description and framework of the Multiple ASsociative Computing (MASC) model of parallel computation is presented. This description identifies MASC objects and ...
Michael Scherger, Jerry L. Potter, Johnnie W. Bake...
134
Voted
ADC
2006
Springer
136views Database» more  ADC 2006»
15 years 9 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
155
Voted
JSAC
2007
133views more  JSAC 2007»
15 years 3 months ago
On broadcasting with cooperative diversity in multi-hop wireless networks
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
Gentian Jakllari, Srikanth V. Krishnamurthy, Micha...
149
Voted
CGF
2010
157views more  CGF 2010»
15 years 1 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen