Sciweavers

829 search results - page 139 / 166
» Distance domination-critical graphs
Sort
View
FOCS
2005
IEEE
15 years 5 months ago
Metric Embeddings with Relaxed Guarantees
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Ked...
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
15 years 5 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
SIAMJO
2010
100views more  SIAMJO 2010»
14 years 6 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
15 years 1 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu
BMCBI
2007
127views more  BMCBI 2007»
14 years 12 months ago
Characterization of protein-interaction networks in tumors
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
Alexander Platzer, Paul Perco, Arno Lukas, Bernd M...