Sciweavers

539 search results - page 15 / 108
» Recurrence relations and fast algorithms
Sort
View
STACS
2004
Springer
14 years 4 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
15 years 6 days ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...
SECURWARE
2008
IEEE
14 years 5 months ago
Fast Algorithms for Local Inconsistency Detection in Firewall ACL Updates
Filtering is a very important issue in next generation networks. These networks consist of a relatively high number of resource constrained devices with very special features, suc...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael M. Ga...
ICMCS
2006
IEEE
137views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Relative Depth Layer Extraction for Monoscopic Video by Use of Multidimensional Filter
This paper presents a relative depth layer extraction system for monoscopic video, using multi-line filters and a layer selection algorithm. Main ideas are to extract multiple li...
Jing-Ying Chang, Chao-Chung Cheng, Shao-Yi Chien, ...
SAC
2010
ACM
14 years 5 months ago
A generative pattern model for mining binary datasets
In many application fields, huge binary datasets modeling real life-phenomena are daily produced. The dataset records are usually associated with observations of some events, and...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...