The SCEAS System
Navigation Menu

Conferences in DBLP

(tamc)
2006 (conf/tamc/2006)

  1. Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci, Luigi Laura
    On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:1-20 [Conf]
  2. Rudi Cilibrasi, Paul M. B. Vitányi
    Similarity of Objects and the Meaning of Words. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:21-45 [Conf]
  3. Rod Downey, Noam Greenberg
    Totally < omegaomega Computably Enumerable and m-topped Degrees. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:46-60 [Conf]
  4. Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
    Mitosis in Computational Complexity. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:61-67 [Conf]
  5. Michael Rathjen
    Models of Intuitionistic Set Theories over Partial Combinatory Algebras. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:68-78 [Conf]
  6. Alasdair Urquhart
    Width Versus Size in Resolution Proofs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:79-88 [Conf]
  7. Andrew Chi-Chih Yao
    Recent Progress in Quantum Computational Complexity. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:89-89 [Conf]
  8. Zhigang Cao, Zhen Wang, Yuzhong Zhang, Shoupeng Liu
    On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:90-98 [Conf]
  9. Ai-ling Chen, Zhi-ming Wu, Gen-ke Yang
    LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:99-107 [Conf]
  10. Jianxin Chen, Yuhang Yang, Hong Zhu, Peng Zeng
    A Bounded Item Bin Packing Problem over Discrete Distribution. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:108-117 [Conf]
  11. Baoqiang Fan, Guochun Tang
    Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:118-127 [Conf]
  12. Jianxing Feng, Daming Zhu
    Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:128-137 [Conf]
  13. Hong Jin, Hui Wang, Hongan Wang, Guozhong Dai
    An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:138-147 [Conf]
  14. Jedrzej Kabarowski, Miroslaw Kutylowski, Wojciech Rutkowski
    Adversary Immune Size Approximation of Single-Hop Radio Networks. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:148-158 [Conf]
  15. Chor Ping Low
    On Load-Balanced Semi-matchings for Weighted Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:159-170 [Conf]
  16. K. Subramani, John Argentieri
    Analyzing Chain Programs over Difference Constraints. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:171-180 [Conf]
  17. Xuehou Tan
    Linear-Time 2-Approximation Algorithm for the Watchman Route Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:181-191 [Conf]
  18. Wenjun Xiao, Behrooz Parhami
    Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:192-197 [Conf]
  19. Yinfeng Xu, Huahai Yan
    Real Time Critical Edge of the Shortest Path in Transportation Networks. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:198-205 [Conf]
  20. Bing Yang, S. Q. Zheng
    Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:206-216 [Conf]
  21. Peng Zhang
    A New Approximation Algorithm for the k-Facility Location Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:217-230 [Conf]
  22. Shai Ben-David
    Alternative Measures of Computational Complexity with Applications to Agnostic Learning. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:231-235 [Conf]
  23. Olaf Beyersdorff
    Disjoint NP-Pairs from Propositional Proof Systems. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:236-247 [Conf]
  24. Jin-yi Cai, Vinay Choudhary
    Valiant's Holant Theorem and Matchgate Tensors. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:248-261 [Conf]
  25. Zhenyu Chen, Decheng Ding
    Variable Minimal Unsatisfiability. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:262-273 [Conf]
  26. Ping Gong, Daoyun Xu
    A New Lower Bound of Critical Function for (k, s)-SAT. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:274-282 [Conf]
  27. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub
    Cluster Computing and the Power of Edge Recognition. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:283-294 [Conf]
  28. Satyanarayana V. Lokam
    Quadratic Lower Bounds on Matrix Rigidity. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:295-307 [Conf]
  29. Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin
    Non-reducible Descriptions for Conditional Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:308-317 [Conf]
  30. M. V. Panduranga Rao
    Generalized Counters and Reversal Complexity. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:318-326 [Conf]
  31. Alexander Shen
    Multisource Algorithmic Information Theory. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:327-338 [Conf]
  32. Xiaoming Sun
    Block Sensitivity of Weakly Symmetric Functions. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:339-344 [Conf]
  33. Christopher Umans
    Optimization Problems in the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:345-355 [Conf]
  34. Mingji Xia, Wenbo Zhao
    #3-Regular Bipartite Planar Vertex Cover is #P-Complete. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:356-364 [Conf]
  35. Guowu Yang, Xiaoyu Song, William N. N. Hung, Fei Xie, Marek A. Perkowski
    Group Theory Based Synthesis of Binary Reversible Circuits. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:365-374 [Conf]
  36. Fuxiang Yu
    On Some Complexity Issues of NC Analytic Functions. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:375-386 [Conf]
  37. Jan Arpe, Rüdiger Reischuk
    Learning Juntas in the Presence of Noise. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:387-398 [Conf]
  38. Chunlin Chen, Daoyi Dong, Zonghai Chen
    Grey Reinforcement Learning for Incomplete Information Processing. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:399-407 [Conf]
  39. Marcus Hutter
    On the Foundations of Universal Sequence Prediction. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:408-420 [Conf]
  40. Sanjay Jain, Frank Stephan
    Some Recent Results in U-Shaped Learning. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:421-431 [Conf]
  41. Lingzhi Liao, Siwei Luo, Mei Tian, Lianwei Zhao
    Learning Overcomplete Representations with a Generalized Gaussian Prior. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:432-441 [Conf]
  42. Rocco A. Servedio
    On PAC Learning Algorithms for Rich Boolean Function Classes. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:442-451 [Conf]
  43. Vladimir Vovk
    On-Line Regression Competitive with Reproducing Kernel Hilbert Spaces. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:452-463 [Conf]
  44. Thomas Zeugmann
    Inductive Inference and Language Learning. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:464-473 [Conf]
  45. Danian Zheng, Jiaxin Wang, Yannan Zhao
    Time Series Predictions Using Multi-scale Support Vector Regressions. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:474-481 [Conf]
  46. Jianning Bi, Yanda Li
    Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:482-493 [Conf]
  47. David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng
    On Probe Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:494-504 [Conf]
  48. Yong Wang, Ling-Yun Wu, Xiang-Sun Zhang, Luonan Chen
    Automatic Classification of Protein Structures Based on Convex Hull Representation by Integrated Neural Network. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:505-514 [Conf]
  49. Zi-Kai Wu, Yong Wang, En-Min Feng, Jin-Cheng Zhao
    Protein Structure Comparison Based on a Measure of Information Discrepancy. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:515-527 [Conf]
  50. Meng Zhang, Jijun Tang, Dong Guo, Liang Hu, Qiang Li
    Succinct Text Indexes on Large Alphabet. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:528-537 [Conf]
  51. Haiyong Bao, Zhenfu Cao, Shengbao Wang
    Identity-Based Threshold Proxy Signature Scheme with Known Signers. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:538-546 [Conf]
  52. Takaaki Mizuki, Taro Otagiri, Hideaki Sone
    Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:547-554 [Conf]
  53. Haiming Chen, Yunmei Dong
    Towards Practical Computable Functions on Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:555-565 [Conf]
  54. Ben Cohen, Martin Escardo, Klaus Keimel
    The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:566-575 [Conf]
  55. Chuanliang Xia
    Analysis of Properties of Petri Synthesis Net. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:576-587 [Conf]
  56. Zaiyue Zhang, Yuefei Sui, Cungen Cao
    A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:588-600 [Conf]
  57. Yujun Zheng, Jinyun Xue, Weibo Liu
    Object-Oriented Specification Composition and Refinement Via Category Theoretic Computations. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:601-610 [Conf]
  58. Conghua Zhou, Decheng Ding
    Improved SAT Based Bounded Model Checking. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:611-620 [Conf]
  59. Cosmin Bonchis, Gabriel Ciobanu, Cornel Izbasa
    Encodings and Arithmetic Operations in Membrane Computing. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:621-630 [Conf]
  60. Olivier Bournez, Manuel Lameiras Campagnolo, Daniel S. Graça, Emmanuel Hainry
    The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:631-643 [Conf]
  61. Jérôme Durand-Lose
    Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:644-653 [Conf]
  62. Lars Kristiansen, Paul J. Voda
    The Trade-Off Theorem and Fragments of Gödel's T. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:654-674 [Conf]
  63. Zhi Ma, Xin Lu, Keqin Feng, Dengguo Feng
    On Non-binary Quantum BCH Codes. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:675-683 [Conf]
  64. Guowu Yang, Jin Yang, Xiaoyu Song, Fei Xie
    Maximal Models of Assertion Graph in GSTE. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:684-693 [Conf]
  65. Bahareh Afshari, George Barmpalias, S. Barry Cooper
    Immunity Properties and the n-C.E. Hierarchy. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:694-703 [Conf]
  66. Serikzhan Badaev
    On Rogers Semilattices. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:704-706 [Conf]
  67. Sanjay Jain, Jochen Nessel, Frank Stephan
    Invertible Classes. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:707-720 [Conf]
  68. Angsheng Li, Yan Song, Guohua Wu
    Universal Cupping Degrees. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:721-730 [Conf]
  69. Angsheng Li, Guohua Wu, Yue Yang
    On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:731-736 [Conf]
  70. Boris Solon, Sergey Rozhkov
    Enumeration Degrees of the Bounded Total Sets. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:737-745 [Conf]
  71. Mariya Ivanova Soskova
    A Generic Set That Does Not Bound a Minimal Pair. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:746-755 [Conf]
  72. Frank Stephan, Liang Yu
    Lowness for Weakly 1-generic and Kurtz-Random. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:756-764 [Conf]
  73. Yue Yang, Liang Yu
    On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:765-771 [Conf]
  74. Alexey Stukachev
    On Mass Problems of Presentability. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:772-782 [Conf]
  75. Klaus Weihrauch, Ning Zhong 0002
    Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable? [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:783-792 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002