Sciweavers

16404 search results - page 813 / 3281
» A set coverage problem
Sort
View
ICIP
2009
IEEE
15 years 5 months ago
Automatic discovery of image families: Global vs. local features
Gathering a large collection of images has been made quite easy by social and image sharing websites, e.g. flickr.com. However, using such collections faces the problem that they ...
Mohamed Aly, Peter Welinder, Mario E. Munich, Piet...
ACCV
2010
Springer
15 years 2 months ago
Medical Image Segmentation Based on Novel Local Order Energy
Image segmentation plays an important role in many medical imaging systems, yet in complex circumstances it is still a challenging problem. Among many difficulties, problem caused ...
LingFeng Wang, Zeyun Yu, Chunhong Pan
CORR
2011
Springer
200views Education» more  CORR 2011»
15 years 2 months ago
Sequential Analysis in High Dimensional Multiple Testing and Sparse Recovery
—This paper studies the problem of high-dimensional multiple testing and sparse recovery from the perspective of sequential analysis. In this setting, the probability of error is...
Matt Malloy, Robert Nowak
JAPLL
2010
111views more  JAPLL 2010»
15 years 2 months ago
The complexity of satisfiability for fragments of hybrid logic - Part I
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
Arne Meier, Martin Mundhenk, Thomas Schneider 0002...
MICS
2010
124views more  MICS 2010»
15 years 2 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger