13336 search results - page 184 / 2668 » Computer Vision: Algorithms and Applications |
144
Voted
IDA
2009
Springer
15 years 8 months ago
2009
Springer
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...
127
click to vote
DATE
2005
IEEE
15 years 9 months ago
2005
IEEE
In this work we consider battery powered portable systems which either have Field Programmable Gate Arrays (FPGA) or voltage and frequency scalable processors as their main proces...
118
click to vote
JPDC
2006
15 years 3 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
106
Voted
AISC
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
143
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...