2531 search results - page 91 / 507 » Group testing in graphs |
98
Voted
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
The identification and processing of similarities in the data play a key role in multiple application scenarios. Several types of similarity-aware operations have been studied in ...
125
click to vote
EUROPAR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order t...
106
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
89
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
102
Voted
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
We propose a unified approach for summarization based on the analysis of video structures and video highlights. Our approach emphasizes both the content balance and perceptual qua...