Sciweavers

202 search results - page 27 / 41
» Performance-Driven Partitioning Using a Replication Graph Ap...
Sort
View
IVC
2008
223views more  IVC 2008»
14 years 11 months ago
Euclidean path modeling for video surveillance
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...
Imran N. Junejo, Hassan Foroosh
FOCS
2009
IEEE
15 years 6 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 6 months ago
Optimizing joins in a map-reduce environment
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
Foto N. Afrati, Jeffrey D. Ullman
ICML
2007
IEEE
16 years 6 days ago
Learning state-action basis functions for hierarchical MDPs
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...
Sarah Osentoski, Sridhar Mahadevan
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 6 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal