Sciweavers

6315 search results - page 924 / 1263
» Approximating Solution Structure
Sort
View
SIAMDM
2010
149views more  SIAMDM 2010»
15 years 3 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
140
Voted
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
15 years 2 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
ICCAD
2009
IEEE
159views Hardware» more  ICCAD 2009»
15 years 2 months ago
First steps towards SAT-based formal analog verification
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...
140
Voted
WWW
2011
ACM
14 years 12 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
14 years 7 months ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...