Sciweavers

526 search results - page 28 / 106
» Increments of Random Partitions
Sort
View
IDEAS
2007
IEEE
128views Database» more  IDEAS 2007»
15 years 6 months ago
Streaming Random Forests
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...
103
Voted
CVPR
2009
IEEE
16 years 6 months ago
Observe Locally, Infer Globally: a Space-Time MRF for Detecting Abnormal Activities with Incremental Updates
We propose a space-time Markov Random Field (MRF) model to detect abnormal activities in video. The nodes in the MRF graph correspond to a grid of local regions in the video fra...
Jaechul Kim (University of Texas at Austin), Krist...
VLSID
2007
IEEE
149views VLSI» more  VLSID 2007»
16 years 4 days ago
Efficient and Accurate Statistical Timing Analysis for Non-Linear Non-Gaussian Variability With Incremental Attributes
Title of thesis: EFFICIENT AND ACCURATE STATISTICAL TIMING ANALYSIS FOR NON-LINEAR NON-GAUSSIAN VARIABILITY WITH INCREMENTAL ATTRIBUTES Ashish Dobhal, Master of Science, 2006 Thes...
Ashish Dobhal, Vishal Khandelwal, Ankur Srivastava
PODC
1998
ACM
15 years 4 months ago
Amortizing Randomness in Private Multiparty Computations
We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the play...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
NETWORKS
2010
14 years 10 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...