Sciweavers

4860 search results - page 466 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
15 years 5 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
CVIU
2011
14 years 7 months ago
A comparative study of object-level spatial context techniques for semantic image analysis
Abstract—In this paper, three approaches to utilizing objectlevel spatial contextual information for semantic image analysis are presented and comparatively evaluated. Contextual...
Georgios Th. Papadopoulos, Carsten Saathoff, Hugo ...
CORR
2004
Springer
90views Education» more  CORR 2004»
15 years 3 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 6 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
CVPR
2012
IEEE
13 years 6 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing