44 search results - page 8 / 9 » On Complexity and Approximability of the Labeled Maximum Per... |
ICB
2009
Springer
14 years 25 days ago
2009
Springer
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
CPM
2005
Springer
13 years 8 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
PODS
2010
ACM
13 years 11 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
TCOM
2010
13 years 4 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....