Sciweavers

4679 search results - page 452 / 936
» Modeling When Connections Are the Problem
Sort
View
202
Voted
VLDB
2004
ACM
134views Database» more  VLDB 2004»
16 years 6 days ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
162
Voted
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
15 years 10 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
149
Voted
IJCAI
2007
15 years 8 months ago
A General Framework for Scheduling in a Stochastic Environment
There are many systems and techniques that address stochastic scheduling problems, based on distinct and sometimes opposite approaches, especially in terms of how scheduling and s...
Julien Bidot, Thierry Vidal, Philippe Laborie, J. ...
169
Voted
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 6 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
KDD
2010
ACM
246views Data Mining» more  KDD 2010»
15 years 5 months ago
Latent aspect rating analysis on review text data: a rating regression approach
In this paper, we define and study a new opinionated text data analysis problem called Latent Aspect Rating Analysis (LARA), which aims at analyzing opinions expressed about an e...
Hongning Wang, Yue Lu, Chengxiang Zhai