Sciweavers

836 search results - page 125 / 168
» Online EM Algorithm for Latent Data Models
Sort
View
JSW
2008
196views more  JSW 2008»
13 years 9 months ago
Providing Data Items with Time Constraints in Multi-Channel Broadcasting Environments
In a mobile computing system, users carrying portable devices can access database services from any location without requiring a fixed position in the networking environment. Some ...
Ding-Jung Chiang, Hwei-Jen Lin, Timothy K. Shih
JMLR
2008
159views more  JMLR 2008»
13 years 9 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
KDD
2008
ACM
202views Data Mining» more  KDD 2008»
14 years 10 months ago
Data and Structural k-Anonymity in Social Networks
The advent of social network sites in the last years seems to be a trend that will likely continue. What naive technology users may not realize is that the information they provide...
Alina Campan, Traian Marius Truta
CIDM
2007
IEEE
14 years 1 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 11 months ago
SPOT: A System for Detecting Projected Outliers From High-dimensional Data Streams
In this paper, we present a new technique, called Stream Projected Ouliter deTector (SPOT), to deal with outlier detection problem in high-dimensional data streams. SPOT is unique ...
Ji Zhang, Qigang Gao, Hai H. Wang