„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Top-k Term-Proximity in Succinct Space
  Munro, J. Ian ; Navarro, Gonzalo ; Nielsen, Jesper Sindahl ; Shah, Rahul ; Thankachan, Sharma V.
• An $$O(\log \mathrm {OPT})$$ O ( log OPT ) -Approximation for Covering and Packing Minor Models of $$\theta _r$$ θ r
  Chatzidimitriou, Dimitris ; Raymond, Jean-Florent ; Sau, Ignasi ; Thilikos, Dimitrios M.
• Guiding the Training of Distributed Text Representation with Supervised Weighting Scheme for Sentiment Analysis
  Zhao, Zhe ; Liu, Tao ; Li, Shen ; Li, Bofang ; Du, Xiaoyong
• Simple Approximation Algorithms for Balanced MAX 2SAT
  Paul, Alice ; Poloczek, Matthias ; Williamson, David P.
• Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem
  Dehouche, Nassim
• Short lists with short programs in short time
  Bauwens, Bruno ; Makhlin, Anton ; Vereshchagin, Nikolay ; Zimand, Marius
• From Discrepancy to Majority
  Eppstein, David ; Hirschberg, Daniel S.
• A C4.5 algorithm for english emotional classification
  Ngoc, Phu Vo ; Ngoc, Chau Vo Thi ; Ngoc, Tran Vo Thi ; Duy, Dat Nguyen
• Model-Based Diversification for Sequential Exploratory Queries
  Khan, Hina A. ; Sharaf, Mohamed A.
• Low-Overhead Paxos Replication
  Guo, Jinwei ; Chu, Jiajia ; Cai, Peng ; Zhou, Minqi ; Zhou, Aoying
• Improved Spanning Ratio for Low Degree Plane Spanners
  Bose, Prosenjit ; Hill, Darryl ; Smid, Michiel
• Special Issue on Graph Processing: Techniques and Applications
  Lin, Xuemin ; Yu, Jeffrey Xu
• On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model
  Bork, Daniel ; Cheng, Ricson ; Wang, Jincheng ; Sung, Jean ; Libeskind-Hadas, Ran
• How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
  Höhn, Wiebke ; Mestre, Julián ; Wiese, Andreas
• Partial Sorting Problem on Evolving Data
  Huang, Qin ; Liu, Xingwu ; Sun, Xiaoming ; Zhang, Jialin
• Feature point matching based on ABC-NCC algorithm
  Banharnsakun, Anan
• Evolutionary algorithm for structural-parametric optimization of the remote photoplethysmography method
  Kopeliovich, M. V. ; Petrushan, M. V. ; Samarin, A. I.
• Development of the algorithm of adaptive construction of hierarchical neural network classifiers
  Svetlov, V. A. ; Dolenko, S. A.
• Block-symmetric polynomials correlate with parity better than symmetric
  Green, Frederic ; Kreymer, Daniel ; Viola, Emanuele
• Sparse affine-invariant linear codes are locally testable
  Ben-Sasson, Eli ; Ron-Zewi, Noga ; Sudan, Madhu