Sciweavers

5583 search results - page 867 / 1117
» Application of Micro-Genetic Algorithm for Task Based Comput...
Sort
View
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 10 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
DAC
2005
ACM
15 years 8 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 6 months ago
Call to order: a hierarchical browsing approach to eliciting users' preference
Computing preference queries has received a lot of attention in the database community. It is common that the user is unsure of his/her preference, so care must be taken to elicit...
Feng Zhao, Gautam Das, Kian-Lee Tan, Anthony K. H....
ICASSP
2010
IEEE
15 years 6 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 6 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...