Sciweavers

201 search results - page 15 / 41
» Rough Set Approximation Based on Dynamic Granulation
Sort
View
ICML
2010
IEEE
13 years 9 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
VLDB
2007
ACM
179views Database» more  VLDB 2007»
14 years 8 months ago
Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data
Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time a...
Xiaolei Li, Jiawei Han
CGF
2008
137views more  CGF 2008»
13 years 8 months ago
Real-Time Indirect Illumination and Soft Shadows in Dynamic Scenes Using Spherical Lights
We present a method for rendering approximate soft shadows and diffuse indirect illumination in dynamic scenes. The proposed method approximates the original scene geometry with a...
P. Guerrero, Stefan Jeschke, Michael Wimmer
TPDS
2008
120views more  TPDS 2008»
13 years 8 months ago
A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks
Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain d...
Jianliang Xu, Xueyan Tang, Wang-Chien Lee
NIPS
2007
13 years 10 months ago
A neural network implementing optimal state estimation based on dynamic spike train decoding
It is becoming increasingly evident that organisms acting in uncertain dynamical environments often employ exact or approximate Bayesian statistical calculations in order to conti...
Omer Bobrowski, Ron Meir, Shy Shoham, Yonina C. El...