Algorithms and Computation
-
Algorithms and Computation: 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001. Proceedings
By Peter EadesIn this paper we have proved that the variation distance is NP-hard to compute, and furthermore that the L∞-distance is hard even to approximate. ... J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan.
-
Algorithms and Computation: 5th International Symposium, ISAAC '94, Beijing, P.R. China, August 25 - 27, 1994. Proceedings
By Ding-Zhu Du, Xiang-Sun ZhangBesides , S.K. Wang , Institute of Applied Mathematics of our Academy , has treated Yang - Baxeter equations with spectrum parameters and discovered a number of entirely new solutions of physical interest by some elaboration of our ...
-
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings
By Dingzhu Du, Xiaotie DengA 1 0 2 3 5 4 6 7 8 9 0 1 2 3 4 5 6 7 8 9 A y=c0 x = c1 y = c2 y = c3 x = c4 x = c5 y = c6 y = c7 y = c8 y = c9 Fig ... level are further partitioned to k sections so there can be at most k⌈log2(hk + 1)⌉ sections in any principal path ...
-
Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings
By Pat Morin, Prosenjit K. BoseWe consider the same one-seller, one-buyer market as above, and compute the profit achieved when trade occurs at some ... the buyer's curve is the downward-sloping linear function q = −adp + bd, but restricts quantity to the range [qd ...
-
Algorithms and Computation: 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings
By Ding-Zhu Du, Ying Fei Dong, Oscar H. IbarraA disentanglement puzzle consists of mechanically interlinked pieces, and the puzzle is solved by disentangling one piece from another set of pieces. A cast puzzle is a type of disentanglement puzzle, where each piece is a zinc ...
-
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings
By Xiaotie Deng, IsaacRecall that for the backbone based scheme, the length of the backbone B(T) is at least log(|T|). However, for rake based scheme, every rake operation decreases the height of the tree at least by 1 and most often more than 1.
-
Algorithms and Computation: 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings
By Tetsuo AsanoApproximately 1/2hth part of the nodes have h additional links and links of same height are nearly uniformly ... 1. Bayer, R.: Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica 1 (1972) 290–306 2.
-
Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings
By Naoki Katoh, Toshihide Ibaraki... hotlinks that minimizes the expected number of links (either tree edges or hotlinks) traversed by a greedy user from the root to a leaf. More formally, given a tree T, representing an index, a hotlink is an edge that does not belong to ...
-
Algorithms and Computation: 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001. Proceedings
By Peter Eades, Tadao Takaoka... Computational Geometry and Applications vol. 7 (6), pp. 539-550, 1997. 5 V. Kantabutra and R. Kosaraju. New ... 1996, pp. 265-285; conference abstract in Proc. of the 5th Candadian Conf. on Computational Geometry, Queen's U., Kingston ...
-
Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings
By Takuro Fukunaga, Hiroshi Nagamochi, Seok-Hee Hong... returns no, we know there is no solution that respects marks. (This is needed for the last step, where we forget the marks.) With our algorithm description, we will also make the first steps towards the time analysis. We derive a number ...
-
Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings
By Rudolf Fleischer, Gerhard Trippen... rendezvous cost in some graphs. It was shown in [16] that cost Ω(logl) is required even for the two-node graph. It ... SIAM J. on Control and Optimization 33 (1995), 673-683. 3. S. Alpern, Rendezvous search on labelled networks, Naval ...
-
Algorithms and Computation: 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings
By Kam W. Ng... Symbolic Computation Systems . Proceedings , 1993. XII , 384 pages . 1993 ... Parallel Computer Architectures . IX , 311 pages . 1993 . Vol . 733 : Th ... Applications . Proceedings , 1993. IX , 434 pages . 1993 . Vol . 736 : R. L. ...