Sciweavers

4886 search results - page 225 / 978
» Approximate Data Exchange
Sort
View
INFOCOM
2012
IEEE
13 years 8 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
16 years 6 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
ICML
2006
IEEE
16 years 7 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
ICCS
2007
Springer
15 years 10 months ago
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets
Abstract. Interpolating scattered data points is a problem of wide ranging interest. One of the most popular interpolation methods in geostatistics is ordinary kriging. The price f...
Nargess Memarsadeghi, David M. Mount
BIOINFORMATICS
2006
85views more  BIOINFORMATICS 2006»
15 years 6 months ago
Clusterv: a tool for assessing the reliability of clusters discovered in DNA microarray data
Summary: We present a new R package for the assessment of the reliability of clusters discovered in high dimensional DNA microarray data. The package implements methods based on r...
Giorgio Valentini