Sciweavers

2719 search results - page 276 / 544
» Exposing Application Alternatives
Sort
View
DSN
2004
IEEE
15 years 10 months ago
Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks
Cyclic Redundancy Codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many commonly used CRC polynomials provide significantly le...
Philip Koopman, Tridib Chakravarty
DCOSS
2006
Springer
15 years 10 months ago
Contour Approximation in Sensor Networks
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
Chiranjeeb Buragohain, Sorabh Gandhi, John Hershbe...
NAA
2000
Springer
131views Mathematics» more  NAA 2000»
15 years 10 months ago
Parallel Monte Carlo Methods for Derivative Security Pricing
Abstract. Monte Carlo (MC) methods have proved to be flexible, robust and very useful techniques in computational finance. Several studies have investigated ways to achieve greater...
Giorgio Pauletto
RECOMB
2000
Springer
15 years 10 months ago
Universal DNA tag systems: a combinatorial design scheme
Custom-designed DNA arrays offer the possibility of simultaneously monitoring thousands of hybridization reactions. These arrays show great potential for many medical and scientif...
Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, ...
189
Voted
RT
2000
Springer
15 years 10 months ago
Exact Illumination in Polygonal Environments using Vertex Tracing
Abstract. Methods for exact computation of irradiance and form factors associated with polygonal objects have ultimately relied on a formula for a differential area to polygon form...
Michael M. Stark, Richard F. Riesenfeld