Sciweavers

15033 search results - page 133 / 3007
» Complexity Theory and Algorithms
Sort
View
BMCBI
2008
131views more  BMCBI 2008»
15 years 4 months ago
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...
Min Li, Jianer Chen, Jianxin Wang, Bin Hu, Gang Ch...
FOCS
1999
IEEE
15 years 8 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 10 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
ICIP
2005
IEEE
15 years 9 months ago
Low complexity resolution progressive image coding algorithm: progres (progressive resolution decompression)
A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm avoids the multiple passes of bit-plane coding for speed impro...
Yushin Cho, William A. Pearlman, Amir Said
131
Voted
WIA
2004
Springer
15 years 9 months ago
On the Complexity of Hopcroft's State Minimization Algorithm
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
Jean Berstel, Olivier Carton