Sciweavers

2924 search results - page 554 / 585
» Lower Bounds in Distributed Computing
Sort
View
SUTC
2010
IEEE
13 years 6 months ago
Reordering for Better Compressibility: Efficient Spatial Sampling in Wireless Sensor Networks
—Compressed Sensing (CS) is a novel sampling paradigm that tries to take data-compression concepts down to the sampling layer of a sensory system. It states that discrete compres...
Mohammadreza Mahmudimanesh, Abdelmajid Khelil, Nee...
IEPOL
2010
130views more  IEPOL 2010»
13 years 5 months ago
Piracy or promotion? The impact of broadband Internet penetration on DVD sales
ABSTRACT Digital computer networks represent a disruptive technology, with the potential to create or destroy economic value in established industries. These opportunities and chal...
Michael D. Smith, Rahul Telang
TASLP
2010
117views more  TASLP 2010»
13 years 2 months ago
Speech Enhancement Using Gaussian Scale Mixture Models
This paper presents a novel probabilistic approach to speech enhancement. Instead of a deterministic logarithmic relationship, we assume a probabilistic relationship between the fr...
Jiucang Hao, Te-Won Lee, Terrence J. Sejnowski
SMA
2003
ACM
120views Solid Modeling» more  SMA 2003»
14 years 28 days ago
Three-dimensional halfspace constructive solid geometry tree construction from implicit boundary representations
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
Suzanne F. Buchele, Richard H. Crawford
SMA
2003
ACM
123views Solid Modeling» more  SMA 2003»
14 years 28 days ago
Collision prediction for polyhedra under screw motions
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
ByungMoon Kim, Jarek Rossignac