Sciweavers

42230 search results - page 6 / 8446
» Algorithms and Complexity Results for
Sort
View
JGAA
2007
135views more  JGAA 2007»
13 years 7 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
FOCS
1995
IEEE
13 years 11 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
VTC
2008
IEEE
105views Communications» more  VTC 2008»
14 years 1 months ago
Practical Results of High Resolution AOA Estimation by the Synthetic Array
— In this paper, a new method for AOA estimation, based on the synthetic ESPRIT algorithm is described and tested with actual CDMA signals. Physical size constraints of handheld ...
Ali Broumandan, John Nielsen, Gérard Lachap...
VISUALIZATION
1995
IEEE
13 years 11 months ago
Visualization of Biological Sequence Similarity Search Results
Biological sequence similarity analysis presents visualization challenges, primarily because of the massive amounts of discrete, multi-dimensional data. Genomic data generated by ...
Ed Huai-hsin Chi, Phillip Barry, Elizabeth Shoop, ...
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
13 years 11 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...