Sciweavers

1594 search results - page 76 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
ICPR
2008
IEEE
15 years 9 months ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang
ISCAS
2005
IEEE
144views Hardware» more  ISCAS 2005»
15 years 8 months ago
A method for online secondary path modeling in active noise control systems
— This paper proposes a new method for online secondary path modeling in active noise control (ANC) systems. The proposed method is a modified version of the basic method, propo...
Muhammad Tahir Akhtar, Masahide Abe, Masayuki Kawa...
NOSSDAV
2004
Springer
15 years 8 months ago
Managing a portfolio of overlay paths
In recent years, several architectures have been proposed and developed for supporting streaming applications that take advantage of multiple paths through the network simultaneou...
Daria Antonova, Arvind Krishnamurthy, Zheng Ma, Ra...
STACS
2004
Springer
15 years 8 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...
AINA
2008
IEEE
15 years 9 months ago
A Map Matching Algorithm for Car Navigation Systems that Predict User Destination
In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predict...
Koichi Miyashita, Tsutomu Terada, Shojiro Nishio