Sciweavers

796 search results - page 20 / 160
» Graph Properties Based Filtering
Sort
View
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 1 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
15 years 6 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
JUCS
2006
107views more  JUCS 2006»
14 years 9 months ago
Sequential Data Assimilation: Information Fusion of a Numerical Simulation and Large Scale Observation Data
: Data assimilation is a method of combining an imperfect simulation model and a number of incomplete observation data. Sequential data assimilation is a data assimilation in which...
Kazuyuki Nakamura, Tomoyuki Higuchi, Naoki Hirose
WADS
2009
Springer
256views Algorithms» more  WADS 2009»
15 years 4 months ago
Dynamic Graph Clustering Using Minimum-Cut Trees
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
Robert Görke, Tanja Hartmann, Dorothea Wagner
GLOBECOM
2008
IEEE
14 years 10 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...