Sciweavers

7522 search results - page 203 / 1505
» Spacing memetic algorithms
Sort
View
PR
2007
184views more  PR 2007»
15 years 4 months ago
Shape retrieval using triangle-area representation and dynamic space warping
We present a shape representation and a matching method for nonrigid shapes with closed contours. The representation utilizes the areas of the triangles formed by the boundary poi...
Naif Alajlan, Ibrahim El Rube, Mohamed S. Kamel, G...
GIS
2010
ACM
15 years 3 months ago
Constrained free space diagrams: a tool for trajectory analysis
We propose a new and powerful tool for the analysis of trajectories, which in particular allows for more temporally aware analyses. Time plays an important role in the analysis of ...
Kevin Buchin, Maike Buchin, Joachim Gudmundsson
ICASSP
2011
IEEE
14 years 9 months ago
Rapid feature space MLLR speaker adaptation with bilinear models
In this paper, we propose a novel method for rapid feature space Maximum Likelihood Linear Regression (FMLLR) speaker adaptation based on bilinear models. When the amount of adapt...
Shilei Zhang, Peder A. Olsen, Yong Qin
169
Voted
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
14 years 5 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 10 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno