Sciweavers

64 search results - page 6 / 13
» The Metric Cutpoint Partition Problem
Sort
View
TCAD
2008
75views more  TCAD 2008»
13 years 7 months ago
Static Analysis of Transaction-Level Communication Models
We propose a methodology for the early estimation of communication implementation choices eftarting from an abstract transaction level system model (TLM). The reference version of ...
Giovanni Agosta, Francesco Bruschi, Donatella Sciu...
ICALP
2010
Springer
14 years 19 days ago
Clustering with Diversity
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
Jian Li, Ke Yi, Qin Zhang
ICDM
2007
IEEE
116views Data Mining» more  ICDM 2007»
14 years 2 months ago
Privacy-Preserving k-NN for Small and Large Data Sets
It is not surprising that there is strong interest in kNN queries to enable clustering, classification and outlierdetection tasks. However, previous approaches to privacypreservi...
Artak Amirbekyan, Vladimir Estivill-Castro
IJRR
2010
114views more  IJRR 2010»
13 years 6 months ago
Generating Uniform Incremental Grids on SO(3) Using the Hopf Fibration
Abstract The problem of generating uniform deterministic samples over the rotation group, SO(3), is fundamental to many fields, such as computational structural biology, robotics,...
Anna Yershova, Swati Jain, Steven M. LaValle, Juli...
KIVS
2011
Springer
12 years 10 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay