Sciweavers

331 search results - page 61 / 67
» Approximation Algorithms for Connected Dominating Sets
Sort
View
COMPGEOM
2008
ACM
15 years 1 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 2 days ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
15 years 5 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
ESWS
2010
Springer
15 years 4 months ago
Leveraging Terminological Structure for Object Reconciliation
Abstract. It has been argued that linked open data is the major benefit of semantic technologies for the web as it provides a huge amount of structured data that can be accessed i...
Jan Noessner, Mathias Niepert, Christian Meilicke,...
ICC
2000
IEEE
15 years 4 months ago
A Framework for the Analysis of Adaptive Voice over IP
— In this paper, we present a framework for the analysis of a set of adaptive variable-bit-rate voice sources in a packet network. The instantaneous bit rate of each source is de...
Claudio Casetti, J. C. De Martin, Michela Meo