新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

AbnerCYH complexity [119 articles]

最近 AbnerCYH さんのライブラリに追加された論文の中から タグ complexity. You can also see everyone's complexity.
  • On the complexity of deriving position specific score matrices from positive and negative sequences
    Discrete Applied Mathematics, Vol. 155, No. 6-7. (1 April 2007), pp. 676-685.
    by Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
    posted to complexity biology algorithms by AbnerCYH on 2008-07-19 09:18:35 as **
  • Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
    (2002), pp. 74-83.
    by Béla Csaba, Marek Karpinski, Piotr Krysta
    posted to testing graph complexity combinatorics algorithms by AbnerCYH on 2008-07-06 19:24:02 as **
  • The Computational Complexity of Link Building
    Computing and Combinatorics (2008), pp. 119-129.
    by Martin Olsen
    posted to kdd complexity by AbnerCYH on 2008-07-04 11:56:16 as **
  • Quasi-bicliques: Complexity and Binding Pairs
    Computing and Combinatorics (2008), pp. 255-264.
    by Xiaowen Liu, Jinyan Li, Lusheng Wang
    posted to graph complexity algorithms by AbnerCYH on 2008-07-04 11:00:06 as **
  • The complexity of Tarski's fixed point theorem
    Theoretical Computer Science, Vol. 401, No. 1-3. (23 July 2008), pp. 228-235.
    by Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti
    posted to topology math complexity by AbnerCYH on 2008-06-26 10:51:13 as **
  • Relativizations of the $\mathcalP = ?\mathcalNP$ Question
    SIAM Journal on Computing, Vol. 4, No. 4. (1975), pp. 431-442.
    by Theodore Baker, John Gill, Robert Solovay
    posted to complexity by AbnerCYH on 2008-06-20 09:38:03 as **
  • Hardness Hypotheses, Derandomization, and Circuit Complexity
    Computational Complexity, Vol. 17, No. 1. (6 April 2008), pp. 119-146.
    by John Hitchcock, A Pavan
    posted to stochastic complexity by AbnerCYH on 2008-06-10 04:05:57 as **
  • Space Complexity Vs. Query Complexity
    Computational Complexity, Vol. 17, No. 1. (6 April 2008), pp. 70-93.
    by Oded Lachish, Ilan Newman, Asaf Shapira
    posted to testing stochastic complexity by AbnerCYH on 2008-06-10 04:04:58 as **
  • The computation of market equilibria
    SIGACT News, Vol. 35, No. 4. (December 2004), pp. 23-37.
    by Bruno Codenotti, Sriram Pemmaraju, Kasturi Varadarajan
    posted to game complexity algorithms by AbnerCYH on 2008-06-10 03:59:50 as *****
  • Primal-dual approximation algorithms for integral flow and multicut in trees
    Algorithmica, Vol. 18, No. 1. (6 May 1997), pp. 3-20.
    by N Garg, V Vazirani, M Yannakakis
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 12:47:42 as **
  • On the complexity of minmax regret linear programming
    European Journal of Operational Research, Vol. 160, No. 1. (1 January 2005), pp. 227-231.
    by Igor Averbakh, Vasilij Lebedev
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 10:25:47 as **
  • Complexity of the min-max and min-max regret assignment problems
    Operations Research Letters, Vol. 33, No. 6. (November 2005), pp. 634-640.
    by Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 09:41:46 as **
  • A note on the minmax regret centdian location on trees
    Operations Research Letters, Vol. 36, No. 2. (March 2008), pp. 271-275.
    by Eduardo Conde
    posted to graph complexity algorithms by AbnerCYH on 2008-06-09 09:37:34 as **
  • Complexity of robust single facility location problems on networks with uncertain edge lengths
    Discrete Applied Mathematics, Vol. 127, No. 3. (1 May 2003), pp. 505-522.
    by Igor Averbakh
    posted to graph complexity automata by AbnerCYH on 2008-06-09 08:50:40 as **
  • The strength of weak learnability
    Machine Learning, Vol. 5, No. 2. (1 June 1990), pp. 197-227.
    by Robert E Schapire
    posted to kdd complexity algorithms by AbnerCYH on 2008-06-03 03:08:47 as **
  • Natural Proofs
    Journal of Computer and System Sciences, Vol. 55, No. 1. (August 1997), pp. 24-35.
    by Alexander A Razborov, Steven Rudich
    posted to complexity by AbnerCYH on 2008-05-15 02:40:41 as **
  • Information measures, effective complexity, and total information
    Complexity, Vol. 2, No. 1. (1996), pp. 44-52.
    by Murray Gell-Mann, Seth Lloyd
    posted to information complexity complex by AbnerCYH on 2008-05-02 16:05:20 as ** along with 4 people rrbarb zambujo itmeson abominable
  • Hierarchical structure and the prediction of missing links in networks
    Nature, Vol. 453, No. 7191., pp. 98-101.
    by Aaron Clauset, Cristopher Moore, MEJ Newman
    posted to graph complexity algorithms by AbnerCYH on 2008-05-02 08:41:08 as ** along with 36 people lfriedl sen_cheng jjray rds Borelli ptrobajo apwesolowski dpf cmmorel fbaroni balicea cmor kengg pbull jago Ema gtgt15 hryk nedwards i-stevenson pinney elsantosneto markusd eyliu craigwilson06 jyuh margaritis gagliol bryanhughes akshat tmmurali cactus tny briordan deanmalmgren soramame_0518
  • Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)
    (11 June 2007)
    by Erich Grädel, Phokion G Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y Vardi, Yde Venema, Scott Weinstein
    posted to complexity logic math by AbnerCYH on 2008-04-22 06:10:52 as ** along with 3 people JakubSzymanik leonardo masteraka
  • Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
    (26 July 2000)
    by Peter Bürgisser
    posted to algebra complexity by AbnerCYH on 2008-04-21 19:12:08 as **
  • Statistical Learning Theory
    (16 September 1998)
    by Vladimir N Vapnik
    posted to complexity kdd stochastic by AbnerCYH on 2008-04-21 19:11:57 as ** along with 12 people and 3 groups jaonary yaroslavvb gyuli grzegorz sdvillal archroad paolo abrentnall bundschu johnkork navil shimazaki Bioinformatics QFRMC_ConsumerCredit generif_paper
  • An Introduction to Computational Learning Theory
    (15 August 1994)
    by Michael J Kearns, Umesh V Vazirani
    posted to complexity kdd stochastic by AbnerCYH on 2008-04-15 14:58:10 as ** along with 3 people and 1 group dsilva BarrosH spirit_of_numenor ComplexAdaptiveSystems
  • Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
    SIAM Journal on Computing, Vol. 28, No. 1. (1998), pp. 105-136.
    by Thomas H Cormen, Thomas Sundquist, Leonard F Wisniewski
    posted to algorithms complexity data_structure parallel by AbnerCYH on 2008-04-03 04:38:17 as **
  • The Complexity of the Partial Order Dimension Problem
    SIAM Journal on Algebraic and Discrete Methods, Vol. 3, No. 3. (1982), pp. 351-358.
    by Mihalis Yannakakis
    posted to complexity order by AbnerCYH on 2008-04-01 02:39:32 as ** along with 2 people Scis0000002 walp
  • A theory of the learnable
    Commun. ACM, Vol. 27, No. 11. (November 1984), pp. 1134-1142.
    by LG Valiant
    posted to algorithms complexity kdd stochastic by AbnerCYH on 2008-03-29 07:16:02 as ** along with 5 people mthomure sdvillal dwf mangesh bsilverthorn
  • A Tutorial on Support Vector Machines for Pattern Recognition
    Data Min. Knowl. Discov., Vol. 2, No. 2. (June 1998), pp. 121-167.
    by Christopher JC Burges
    posted to algorithms complexity kdd by AbnerCYH on 2008-03-28 15:42:38 as ** along with 9 people and 1 group joelh zoop drivard kgajos Mohan-S tgyork vlachmore dcastro asterix77 LIVIA
  • Fixed-Parameter Tractability, Definability, and Model-Checking
    SIAM Journal on Computing, Vol. 31, No. 1. (2001), pp. 113-145.
    by Jörg Flum, Martin Grohe
    posted to algorithms complexity graph logic parameterized by AbnerCYH on 2008-03-26 09:20:30 as **
  • A Variant to Turing's Theory of Computing Machines
    J. ACM, Vol. 4, No. 1. (January 1957), pp. 63-92.
    by Hao Wang
    posted to complexity by AbnerCYH on 2008-03-25 08:42:10 as **
  • What is a pointer machine?
    SIGACT News, Vol. 26, No. 2. (June 1995), pp. 88-95.
    by Amir M Ben-Amram
    posted to algorithms complexity by AbnerCYH on 2008-03-24 18:24:14 as **
  • Expected time bounds for selection
    Commun. ACM, Vol. 18, No. 3. (March 1975), pp. 165-172.
    by Robert W Floyd, Ronald L Rivest
    posted to algorithms complexity by AbnerCYH on 2008-03-18 05:00:45 as **
  • If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
    Computational Complexity, Vol. 16, No. 4. (29 December 2007), pp. 412-441.
    by Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
    posted to complexity by AbnerCYH on 2008-02-18 22:09:01 as **
  • Adaptive sorting: an information theoretic perspective
    Acta Informatica, Vol. 45, No. 1. (19 February 2008), pp. 33-42.
    by Amr Elmasry, Michael Fredman
    posted to algorithms complexity information by AbnerCYH on 2008-02-08 21:53:47 as **
  • Zero-Knowledge Proofs of the Conjugacy for Permutation Groups
    (31 Jan 2008)
    by Oleg Verbitsky
    posted to algebra algorithms combinatorics complexity by AbnerCYH on 2008-02-02 06:13:18 as **
  • An optimal minimum spanning tree algorithm
    J. ACM, Vol. 49, No. 1. (January 2002), pp. 16-34.
    by Seth Pettie, Vijaya Ramachandran
    posted to algorithms complexity graph by AbnerCYH on 2008-01-24 19:35:31 as **
  • Minimization of decision trees is hard to approximate
    Journal of Computer and System Sciences, Vol. 74, No. 3. (May 2008), pp. 394-403.
    by Detlef Sieling
    posted to algorithms complexity kdd logic by AbnerCYH on 2008-01-22 14:44:55 as **
  • Open problems around exact algorithms
    Discrete Applied Mathematics, Vol. 156, No. 3. (1 February 2008), pp. 397-405.
    by Gerhard J Woeginger
    posted to algorithms complexity by AbnerCYH on 2008-01-14 07:58:12 as **
  • Kolmogorov complexities Kmax, Kmin on computable partially ordered sets
    (2 Jan 2008)
    by Marie Ferbus-Zanda, Serge Grigorieff
    posted to algorithms complexity logic order by AbnerCYH on 2008-01-04 12:39:07 as ** along with 1 person A_Olympia
  • Is Randomness "Native" to Computer Science?
    (1 Jan 2008)
    by Marie Ferbus-Zanda, Serge Grigorieff
    posted to complexity logic math by AbnerCYH on 2008-01-04 12:36:43 as ** along with 1 person ansobol
  • Computer algebra in systems biology
    (27 Dec 2007)
    by Reinhard Laubenbacher, Bernd Sturmfels
    posted to algebra algorithms biology complex complexity math by AbnerCYH on 2007-12-28 08:52:39 as **
  • On Two Techniques of Combining Branching and Treewidth
    Algorithmica
    by Fedor Fomin, Serge Gaspers, Saket Saurabh, Alexey Stepanov
    posted to algorithms complexity graph math optimization parameterized by AbnerCYH on 2007-12-19 05:34:12 as **
  • Improved Algorithms and Complexity Results for Power Domination in Graphs
    Algorithmica
    by Jiong Guo, Rolf Niedermeier, Daniel Raible
    posted to algorithms complexity graph parameterized by AbnerCYH on 2007-12-10 04:31:52 as **
  • On Fixed-Parameter Tractability and Approximability of NP Optimization Problems
    Journal of Computer and System Sciences, Vol. 54, No. 3. (June 1997), pp. 465-474.
    by Liming Cai, Jianer Chen
    posted to algorithms complexity optimization parameterized by AbnerCYH on 2007-11-15 09:25:10 as **
  • Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
    Parameterized and Exact Computation (2006), pp. 96-108.
    by Liming Cai, Xiuzhen Huang
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-13 17:12:36 as **
  • Parameterized Approximation Problems
    Parameterized and Exact Computation (2006), pp. 121-129.
    by Rodney Downey, Michael Fellows, Catherine Mccartin
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-13 17:09:55 as **
  • Parameterized complexity and polynomial-time approximation schemes
    (December 2004)
    by Xiuzhen Huang
    posted to algorithms complexity optimization parameterized by AbnerCYH on 2007-11-13 10:34:03 as **
  • Minimum Membership Set Covering and the Consecutive Ones Property
    Algorithm Theory – SWAT 2006 (2006), pp. 339-350.
    by Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
    posted to algorithms biology complexity parameterized by AbnerCYH on 2007-11-11 18:09:19 as **
  • On The Parameterized Intractability Of Motif Search Problems
    Combinatorica, Vol. 26, No. 2. (30 April 2006), pp. 141-167.
    by Michael Fellows, Jens Gramm, Rolf Niedermeier
    posted to biology combinatorics complexity graph parameterized by AbnerCYH on 2007-11-10 19:08:20 as **
  • Parameterized Complexity and Biopolymer Sequence Comparison
    The Computer Journal, Vol. 51, No. 3. (27 June 2007), bxm035.
    by Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances Rosamond, Yinglei Song
    posted to biology complexity parameterized by AbnerCYH on 2007-11-10 18:58:22 as **
  • On the Parameterized Intractability of CLOSEST SUBSTRING and Related Problems
    STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002. Proceedings (2002), pp. 734-734.
    by Michael R Fellows, Jens Gramm, Rolf Niedermeier
    posted to algorithms complexity parameterized by AbnerCYH on 2007-11-10 12:15:48 as **
  • On the strength of comparisons in property testing
    Information and Computation, Vol. 189, No. 1. (25 February 2004), pp. 107-116.
    by Eldar Fischer
    posted to algorithms complexity testing by AbnerCYH on 2007-11-10 12:14:37 as *****
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/AbnerCYH/tag/complexity

    Result page: 1 2 3 Next RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.