Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
30
click to vote
DCOSS
2008
Springer
favorite
Email
discuss
report
79
views
Distributed And Parallel Com...
»
more
DCOSS 2008
»
Stochastic Counting in Sensor Networks, or: Noise Is Good
14 years 1 months ago
Download
www.ee.columbia.edu
We propose a novel algorithm of counting indistinguishable objects by a collection of sensors. The information on multiple counting is recovered from the stochastic correlation patterns.
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung
Real-time Traffic
DCOSS 2008
|
Distributed And Parallel Computing
|
Indistinguishable Objects
|
Multiple Counting
|
Stochastic Correlation Patterns
|
claim paper
Post Info
More Details (n/a)
Added
19 Oct 2010
Updated
19 Oct 2010
Type
Conference
Year
2008
Where
DCOSS
Authors
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Kyung Joon Kwak, Bill Moran
Comments
(0)
Researcher Info
Distributed And Parallel Computing Study Group
Computer Vision