Sciweavers

1871 search results - page 322 / 375
» The Ephemeral Pairing Problem
Sort
View
CORR
2011
Springer
222views Education» more  CORR 2011»
14 years 2 months ago
A New Data Layout For Set Intersection on GPUs
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
Rasmus Resen Amossen, Rasmus Pagh
IPMI
2011
Springer
14 years 2 months ago
Globally Optimal Tumor Segmentation in PET-CT Images: A Graph-Based Co-segmentation Method
Tumor segmentation in PET and CT images is notoriously challenging due to the low spatial resolution in PET and low contrast in CT images. In this paper, we proposed a general fram...
Dongfeng Han, John E. Bayouth, Qi Song, Aakant Tau...
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
15 years 11 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
STACS
2007
Springer
15 years 5 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman
CVPR
2006
IEEE
16 years 1 months ago
Escaping local minima through hierarchical model selection: Automatic object discovery, segmentation, and tracking in video
Recently, the generative modeling approach to video segmentation has been gaining popularity in the computer vision community. For example, the flexible sprites framework has been...
Nebojsa Jojic, John M. Winn, Larry Zitnick