Sciweavers

536 search results - page 49 / 108
» The hardness and approximation algorithms for l-diversity
Sort
View
ATAL
2007
Springer
14 years 2 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
COMPGEOM
2010
ACM
14 years 1 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
SECON
2010
IEEE
13 years 6 months ago
Transmission Scheduling for Routing Paths in Cognitive Radio Mesh Networks
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...
Brendan Mumey, Xia Zhao, Jian Tang, Richard S. Wol...
ICASSP
2011
IEEE
12 years 11 months ago
Robust secondary multicast transmit beamforming for cognitive radio networks under imperfect channel state information
Consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive radio (CR) n...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
BILDMED
2011
225views Algorithms» more  BILDMED 2011»
12 years 11 months ago
Using Power Watersheds to Segment Benign Thyroid Nodules in Ultrasound Image Data
Thyroid nodule segmentation is a hard task due to different echo structures, textures and echogenicities in ultrasound (US) images as well as speckle noise. Currently, a typical c...
Eva N. K. Kollorz, Elli Angelopoulou, Michael Beck...