Sciweavers

620 search results - page 101 / 124
» The edge-flipping group of a graph
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 7 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
SOSP
2009
ACM
14 years 4 months ago
Distributed aggregation for data-parallel computing: interfaces and implementations
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
Yuan Yu, Pradeep Kumar Gunda, Michael Isard
CVPR
2010
IEEE
14 years 4 months ago
Finding Dots: Segmentation as Popping out Regions from Boundaries
Many applications need to segment out all small round regions in an image. This task of finding dots can be viewed as a region segmentation problem where the dots form one regio...
Elena Bernardis, Stella Yu
CVPR
2010
IEEE
14 years 4 months ago
Nonparametric Higher-Order Learning for Interactive Segmentation
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
SASO
2009
IEEE
14 years 2 months ago
Swarming Polyagents Executing Hierarchical Task Networks
Swarming agents often operate in benign geographic topologies that let them explore alternative trajectories with minor variations that the agent dynamics then amplify for improve...
Sven A. Brueckner, Theodore C. Belding, Robert Bis...