Sciweavers

1629 search results - page 78 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
CVPR
2003
IEEE
15 years 12 months ago
Extracting Dense Features for Visual Correspondence with Graph Cuts
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
Olga Veksler
ICTAI
2009
IEEE
14 years 7 months ago
Constraint-Based Evolutionary QoS Adaptation for Power Utility Communication Networks
This paper studies an evolutionary multiobjective optimization algorithm, called EVOLT, which heuristically optimizes QoS (quality of service) in communication networks for electr...
Paskorn Champrasert, Junichi Suzuki, Tetsuo Otani
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
15 years 4 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
ISCAS
1994
IEEE
124views Hardware» more  ISCAS 1994»
15 years 2 months ago
Efficient Gabor Filter Design Using Rician Output Statistics
Gabor filters have been applied sucessfully to a broad range of multidimensional signal processing and image processing tasks. The present paper considers the design of a single f...
Thomas P. Weldon, William E. Higgins, Dennis F. Du...