Sciweavers

2223 search results - page 250 / 445
» Ontological Framework for Approximation
Sort
View
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 7 months ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001
CVPR
2012
IEEE
13 years 7 months ago
Boosting algorithms for simultaneous feature extraction and selection
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Mohammad J. Saberian, Nuno Vasconcelos
EDBT
2008
ACM
125views Database» more  EDBT 2008»
16 years 5 months ago
On the brink: searching for drops in sensor data
Sensor networks have been widely used to collect data about the environment. When analyzing data from these systems, people tend to ask exploratory questions--they want to find su...
Gong Chen, Junghoo Cho, Mark H. Hansen
ICRA
2007
IEEE
164views Robotics» more  ICRA 2007»
15 years 11 months ago
Affect Recognition in Robot Assisted Rehabilitation of Children with Autism Spectrum Disorder
–This paper presents a novel affect-sensitive human-robot interaction framework for rehabilitation of children with autism spectrum disorder (ASD). The overall aim is to enable t...
Changchun Liu, Karla Conn, Nilanjan Sarkar, Wendy ...
ACSD
2007
IEEE
67views Hardware» more  ACSD 2007»
15 years 11 months ago
Hazard Checking of Timed Asynchronous Circuits Revisited
This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion...
Frédéric Béal, Tomohiro Yoned...