Sciweavers

3875 search results - page 513 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
TCOM
2010
133views more  TCOM 2010»
15 years 5 months ago
Transmission control in cognitive radio as a Markovian dynamic game: Structural result on randomized threshold policies
Abstract——This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...
J. Huang, V. Krishnamurthy
ICDM
2010
IEEE
150views Data Mining» more  ICDM 2010»
15 years 4 months ago
Probabilistic Inference Protection on Anonymized Data
Background knowledge is an important factor in privacy preserving data publishing. Probabilistic distributionbased background knowledge is a powerful kind of background knowledge w...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, Y...
INFOCOM
2007
IEEE
16 years 28 days ago
Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...
Zhenzhen Ye, Alhussein A. Abouzeid, Jing Ai
SIAMSC
2011
153views more  SIAMSC 2011»
15 years 1 months ago
Stable Computations with Gaussian Radial Basis Functions
Abstract. Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in non-trivial geometries, since the method is meshfree and can ...
Bengt Fornberg, Elisabeth Larsson, Natasha Flyer
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 10 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi