ftp.math.utah.eduftp.math.utah.edu/pub//tex/bib/lncs2002c.pdf · A Bibliography of Papers in...

A Bibliography of Papers in Lecture Notes in Computer

Science (2002) (Part 3 of 4)

Nelson H. F. BeebeUniversity of Utah

Department of Mathematics, 110 LCB155 S 1400 E RM 233

Salt Lake City, UT 84112-0090USA

Tel: +1 801 581 5254FAX: +1 801 581 4148

E-mail: [email protected], [email protected],[email protected] (Internet)

WWW URL: http://www.math.utah.edu/~beebe/

04 February 2014Version 1.11

Title word cross-reference

(2 + f(n)) [599]. 1 [642, 1201, 524]. 2[526, 1036, 1273, 1251, 1236, 81]. 2m [612]. 3[493, 872, 1761, 1036, 842, 1039, 639]. 5[1422]. (2,128) [522]. ∗ [409]. 2 [314]. ] [117].st [1039]. TM [1337]. PASS [785]. Z [738]. β[290]. δ [91]. ` [1181]. k [1487, 1181, 440,1235, 917, 426, 640, 648, 916, 624, 501, 846].λ [290]. m [540]. Fq [526]. q [94]. K [765].O(\ log \) [402]. µ [797]. n [540, 652]. n− 3[652]. Ω [775, 558, 776]. s, z, C, t [964].

-Ary [440]. -BM [91]. -Calculus [290, 797].-Channel [624]. -D [872, 1273, 842, 1201].-Dimensional [642]. -Gram [94].-Grammar [846]. -Interval [81].

-Matching [91]. -Means [1487]. -Median[917]. -NN [501]. -out-of- [1181]. -Path[1236]. -Reduction [290]. -SAT [599].-Trees [640]. -Truck [648]. -Uniform [426].-Vertex [652].

.NET [1119].

/s [968].

1.0 [777]. 11monkeys3 [218].

2-Compromise [642]. 2-SAT [651]. 2.0[785]. 2001 [1318, 280, 1321, 1339, 284, 221].2SAT [569].

3-Pass [541]. 3-SAT [651]. 3-Secure [535].3T [219].

1

2

4-Slot [748].

5-Regular [620]. 5dpo [238]. 5P [703].

802.11e [1254].

= [1362, 396].

A-Prolog [1391]. AAFG1 [525]. ABA[1001]. ABBA [1484]. Abbreviation [984].Abduction [1366, 1388, 1361, 1399, 1397].Abelian [445]. Abstract[1419, 1102, 50, 621, 611, 1547, 1418, 617, 66,638, 650, 626, 32, 1103, 601, 455, 44].AbstractCollection [590]. Abstracting[46, 39]. Abstraction [47, 49, 757, 51, 28,1096, 30, 21, 23, 738, 747, 45].Abstraction-Based [1096]. Abstractions[117, 43, 54, 1446, 55]. Academic[1076, 1075]. ACAS [577]. Accelerating[988]. Acceleration [1413].Accelerometers [1562]. Acceptability[1359]. Acceptable [1252]. Access [1077,1066, 1171, 1061, 1553, 1216, 1026, 1078,1227, 933, 1028, 1068, 1328, 1228, 1002, 1017,164, 1060, 1022, 996, 936, 1055, 1009, 976].Accesses [1468]. Accessibility[1030, 939, 943, 1021, 937, 1053, 944, 1008].Accessible[957, 1006, 1012, 995, 1069, 1081, 991, 994].Accessing [715, 980, 1064, 1299, 959].Accommodating [605]. Accumulating[63]. Accumulation [887]. Accumulators[928]. Accuracy [1637]. Accurate[184, 1036, 1730]. Achieve [943].Achievements [1363]. Achieving [248].Acoustic [1742]. Acquisition [549, 722].Across [1339, 809, 1546]. Act [1065].Acting [1243]. Action [1094, 1613, 33, 250].Actions [1700, 1536, 44]. Activation [178].Activation/Termination [178]. Active[468, 9, 1307, 645, 1713, 536]. Activity[1608, 1576, 1750, 1575, 674].Activity-Dependent [1576]. Actuator

[1037]. ad [1241, 372, 1240]. Adaptability[1706]. Adaptable [325]. Adaptation[1598, 108]. Adapted [1058]. Adapting[13, 1257]. Adaptive [1783, 1733, 1757, 972,1012, 356, 1642, 1762, 1669, 1293, 1641, 1777,1255, 950, 1471, 981, 1501, 1289, 1736, 1211].Addition [542]. Addition-Subtraction[542]. Additional [181]. Addizionario[958]. Address [1175]. Adjusting[1135, 1414]. Administration [533].Admissibility [1426]. Admissible [25].Adolescents [987]. Adopting [319].Adpated [837]. Advances [669].Advantages [703]. Adverbs [711].Adversaries [547]. Adversary [177]. AES[529]. Affine [1145, 900, 503]. Affordance[944]. against [546, 536]. Agent[72, 1281, 1476, 1285, 1479, 1542, 1531, 1288,1484, 1289, 224, 1278, 1538, 165, 1539, 1280,186, 1282, 1283, 560, 1541, 282, 1537, 1287,1477, 1481, 1490]. Agent-Assisted [1476].Agent-Based [1281, 1542].Agent-Mediated [1278]. Agents [1530,1354, 544, 1276, 1284, 1372, 1286, 201, 1535,1373, 1544, 1475, 823, 953, 171, 172, 1725,281, 1543, 1540, 7, 1478, 1489, 1740, 1483].Aggregates [1447, 1380]. Aggregation[352]. AGILE [1476]. Agility [248].AGILO [250]. Agnostic [997, 127]. Aid[1019]. Aided [979, 1018]. Air [1735].Alarm [1056]. ALDMEISTER [801].Algebra [571, 550, 577, 401, 593, 576].Algebraic [580, 525, 388, 32, 1436, 362].Algebras [1100]. Algorithm[1232, 1212, 1514, 1155, 1679, 135, 1626, 1487,1757, 1240, 1181, 1521, 663, 887, 1308, 1136,917, 879, 1159, 1467, 528, 442, 871, 1245, 1525,1655, 1257, 1250, 637, 1251, 685, 1734, 1433,674, 916, 504, 1410, 348, 1405, 641, 1182, 1217,1201, 1738, 1448, 1764, 1144, 1625, 1256].Algorithm-Based [674]. Algorithmic[737, 783]. Algorithms [1130, 570, 357, 185,853, 378, 91, 1199, 1406, 1198, 584, 1782,847, 603, 1235, 1669, 567, 1213, 88, 604, 640,

3

615, 147, 148, 1631, 1180, 1156, 624, 1158,919, 1413, 1746, 634, 623, 425, 1218].Aligned [1325]. Aligning [76]. Alignment[606]. Alive [913]. All-Pairs [348].All-to-All [1217]. Allocation[283, 1405, 1533]. Allowable [1252].Allowing [95]. Aloud [992]. Alpha[1527, 1029, 524]. Alpha-Beta [1527].Alternate [1298, 1082]. Alternating [411].Alternative [1534, 1392, 1067]. Alzheimer[555]. Ambiguity [714, 397]. AMEEDA[1137]. Amenable [1626]. American [1066].AMIS [1012]. Amit [468]. Among[217, 106, 823, 1076]. Analog [1777].Analysing [509]. Analysis [890, 1573, 1091,432, 803, 498, 1125, 1647, 1582, 1632, 835,1744, 1749, 1651, 1102, 671, 1677, 697, 1307,1093, 490, 1045, 857, 1597, 749, 885, 813, 930,1627, 528, 1210, 290, 676, 1505, 1595, 1665,1708, 1433, 674, 1120, 287, 1336, 747, 919,731, 1596, 1746, 1326, 61, 335, 523, 806, 1760,1163, 1532, 1787, 1113, 1579, 830, 334, 512].Analytic [445, 446]. Analyze [192].Analyzers [1716]. Anaphora [693, 700].Anaphoric [705]. AND/OR [621].Animated [953]. Anisotropic [477].Annealing [1633, 1753]. Annotating [819].Annotation [1566, 903, 725]. Annotations[85, 311, 327]. Anomaly [673]. Anonymous[613]. Answer [64]. Answering [459, 449].Antenna [1249, 1261]. Anthropological[1282]. Antirandomizing [415]. Any[1643]. AOP [101]. Aperiodic [1575]. API[1189]. Appearance [666, 690].Appearance-Based [666, 690]. Applets[1187]. Applicable [896]. Application[1165, 1767, 989, 92, 713, 316, 1203, 871, 635,883, 681, 1542, 866, 1471, 66, 1758, 1484,1502, 108, 78, 1019, 165, 107].Application-Engineering [316].Application-Oriented [1542].Applications [1124, 464, 303, 145, 675,1126, 1042, 1123, 374, 1548, 89, 409, 1227,1160, 1224, 948, 1229, 1667, 457, 1196, 1556,

1218, 762, 15, 428, 334, 1137, 534]. Applied[1743, 1616, 1778, 1027, 1773, 690]. Apply[1135]. Applying [1582, 1652]. Approach[1779, 876, 1390, 780, 737, 1051, 1282, 1102,112, 1233, 680, 109, 553, 1677, 870, 1491,1661, 923, 857, 1642, 1042, 1613, 952, 1360,282, 545, 1698, 201, 1432, 1059, 204, 205,1618, 1665, 1526, 983, 210, 388, 1692, 1434,920, 918, 1472, 914, 1178, 1315, 767, 1300, 2,165, 568, 613, 926, 888, 321, 1456].Approaches [331, 1494]. approximability[1133, 1134]. Approximate[95, 1294, 93, 1104, 414, 34, 1533].Approximated [917, 845]. Approximating[412, 639]. Approximation [392, 48, 423,1659, 1658, 625, 31, 1691, 1643, 78, 37, 38].Approximations [346, 43]. APT [1733].APT-Based [1733]. Arab [1016]. Arabic[856]. ARAIBO [278]. Arbitrage [1493].Arc [85]. Archeological [500].Architecting [1023]. Architectural[114, 1787]. Architecture[1247, 1561, 1530, 733, 1220, 824, 1613, 1541,1167, 615, 1173, 1531, 208, 3, 1000, 219, 1224,224, 1769, 324, 1179, 220, 1256, 1489, 322].Architecture-Level [3]. Architectures[1124, 1150, 1231, 612, 339, 323, 17, 1218].Archival [491]. ArchJava [114]. Arcs[867]. Area [1099, 1058, 1244]. Areas[1586]. Argument [1389]. Argumentation[1387, 1278]. Argumentation-Based[1387]. Arising [1097]. Arithmetic[950, 1614]. Arity [574]. ARMA [1747].armed [144]. Arrangements [430]. Array[1037]. Arrays [615, 1249, 637, 1142].Artefacts [331]. Arthur [598]. Artificial[1751, 1499, 1696, 1279]. Artisti [251].ARTMAP [1639]. Ary [440]. Aspects[565, 783]. ASR [718]. Assembler [749].Assembling [628]. Assembly[8, 595, 19, 341]. Assertions [1117].Assessing [960]. Assessment[1751, 1086, 1203, 1368, 727, 988, 976].Asset [338]. Assignment [1475].

4

Assignments [651]. Assist [975].Assistance [1014, 989, 971]. Assisted[987, 990, 1476]. Assistive [1087, 951, 1086,978, 1082, 1083, 1084, 1079, 1057, 976].Associated [476]. Association[1171, 836, 1769, 1304]. Associative[1492, 1577, 827, 831, 1614]. Assumptions[530]. ASURA [266]. Asymmetric[883, 530]. Asymptotic [1720].Asymptotically [1136]. Asynchronous[1184, 1608, 748, 1195, 547, 623]. ATM[1257]. Atomic [307, 105, 1166]. Atoms[783]. AtomsNet [484]. Attack [525, 542].Attacks [1370, 536]. Attention[875, 1569, 170, 873, 1774]. Attentional[1768]. Attitudes [1066]. Attractor [1600].Attributes [1515, 1446]. ATTUnited [221].ATTUnited-2001 [221]. Auction [1533].Auctions [1278]. Audio[498, 499, 1039, 1763, 670]. Audio-Visual[499, 1763]. Auditing [939]. Auditory[1023, 1018, 1017]. Augmentative [1067].Augmented [366, 1321]. Austrian [1076].Austrian-Wide [1076]. Authenticated[537]. Authentication [1555, 677].Authentification [869]. Author[763, 804, 834, 841, 932, 1088, 1105, 1246,1275, 1291, 1312, 1350, 1375, 1400, 1416,1439, 1529, 1545, 1568, 1790, 20, 60, 75, 99,126, 154, 285, 315, 340, 431, 456, 469, 510,548, 579, 594, 658, 691, 728]. Authorization[532]. Auto [1492]. Auto-Associative[1492]. AutoBayes [788]. AutoBayes/CC[788]. Automata [411, 723, 655, 1620, 628,355, 367, 368, 830, 656]. Automated[436, 709, 1445, 1388, 1010, 730, 1502, 1114,489, 557]. Automatic[1785, 1775, 1126, 911, 1566, 903, 1660, 1433,693, 722, 816, 914, 1540, 1132, 107, 788].Automation [28, 1260]. Automed[1297, 1295, 1296]. Automotive [1547].AutoMouse [1030]. Autonomous[112, 166, 1488, 54, 174, 1540, 1703].Autoregressive [1760]. Autowrite [312].

Auxiliary [734]. Availability [1185].Average [383]. Averages [128].Avoidance [175]. Aware [72, 15].Awareness [1069, 1563]. Axiomatic [289].Axiomatising [389]. Axioms [358]. Axis[146].

B [730, 396, 760]. B2B [534]. BabyTigers[267]. Back [1552, 1765, 650].Back-Propagation [1765].Back-Walk-Free [650]. Backward [477].Bagging [689]. Balancing [1128, 1161].Banach [422]. Banach-Mazur [422]. band[718]. Bandit [144]. Bandwidth [1210].Barrel [674]. Barrier [1216]. Barriers[1072]. Base [1483]. Based[890, 493, 1232, 1644, 1401, 1281, 1788, 780,931, 288, 1761, 1214, 1704, 1140, 185, 669,1514, 507, 1744, 696, 1325, 1241, 239, 156,666, 717, 875, 436, 1733, 1493, 1330, 1555,1677, 694, 1181, 1126, 490, 329, 1231, 192,1387, 479, 482, 113, 1732, 887, 1216, 771,1604, 1729, 904, 1294, 859, 1360, 1298, 454,930, 905, 844, 1383, 1078, 555, 1116, 871,1473, 684, 907, 1096, 151, 102, 118, 1594, 1525,736, 1373, 360, 681, 499, 538, 337, 1542, 478,1364, 1265, 208, 487, 683, 1244, 1656, 12, 678,842, 86, 699, 1056, 674, 823, 170, 116, 965].Based[1384, 1606, 873, 765, 918, 504, 1484, 1076,1715, 1221, 62, 1472, 1299, 19, 496, 1667, 486,1182, 78, 1326, 690, 840, 250, 174, 175, 1540,1774, 922, 492, 123, 910, 2, 1452, 695, 1506,165, 623, 1532, 1533, 1742, 568, 1463, 44, 1722,1211, 215, 473, 926, 321, 481, 687, 334, 1457,1512, 1676, 119, 1456, 1489, 1740, 1668, 912].Based-On [1514]. Bases [815]. Basic[570, 439, 252, 950, 800, 345, 401]. Basis[1624, 1621, 1701, 756, 1668]. Basketball[499]. Baum [1759]. Baum-Welch [1759].Bayes [151, 1676]. Bayes-Mixtures [151].bayesian [848, 915, 904, 1665, 505]. BCI[1752]. BDD [765]. BDD-Based [765].BDI [1290]. Be [790, 997]. Beaver [1484].

5

Bed [165]. Behalf [1243]. Behavior[1704, 222, 208, 178, 215]. Behavior-Based[208]. Behavioral [124]. Behaviors [269].Behaviour [192, 224, 108]. Behaviours[72, 13]. Belief [446, 825]. Beliefs [1606].Bend [646]. Benefit [1563]. Best [1399].Beta [1527]. Better [92, 122, 521].Between [1458, 507, 143, 952, 773, 1550,542, 1538, 1539]. Beyond [10, 1749, 933]. Bi[1325, 771]. Bi-directional [1325].Bialgebraic [384]. Bias [1787]. BiBa [521].BIKMAS [1504]. Bilinear [538]. Bilingual[1319, 1333, 1317, 1332, 1323, 1327]. Bill[1742]. Bimodal [446]. Bin [366]. binary[52]. Binding [1638]. Bins [644]. Bio [1056].Bio-Sensor [1056]. BioGRID [1229].Bioinformatics [839, 1504]. Biologically[1573, 923]. Biomedical [720, 886].Biomoleculago [1229]. Biophysical [1594].Bipartite [1274, 425]. Biped [1694, 161].BISECTION [392]. Bisimilarity [401].Bisimulation [746]. BIST [1266]. Bit[1447, 122, 93]. Bit-Parallel [93].Bit-Sliced [1447]. Bit-Vector [122]. Biter[188]. Black [1402]. Black-Box [1402].Blackmailing [545]. Blind[1031, 1044, 1045, 1042, 1026, 1024, 1756,1004, 1010, 998, 1080, 1028, 1040, 1041, 1034,1062, 1022, 1035, 1001, 1009]. Blobs [200].Block [97, 79]. Blocking [475, 1201].Blocks [1656]. BlueGene [1131].BlueGene/L [1131]. Blues [1615]. Blur[1767]. BM [91]. Bob [1352]. Bohm [297].Boltzmann [1626, 382, 1614, 1166, 1625].Bonkers [1059]. Books [933]. Boolean[40, 570, 780, 443, 789]. Boosting [147, 149].Bound [362, 1159, 1467, 855]. Boundaries[1178]. Boundary [730]. Bounded[369, 1133, 392, 372, 359, 1286, 370, 358, 798,653, 601, 623]. Bounded-Depth [358].Bounds [131, 145, 393, 366, 144, 74, 1663,1098, 391, 305, 142]. Box [1402]. Braid[525]. Braille[1050, 1033, 1049, 1051, 1048, 1002]. Brain

[1750, 1505, 1586]. Brains [230].Brainstormers [210]. Branch[370, 1159, 1467]. Branching [369].Brazilian [719]. Breadth [1403].Breadth-First [1403]. Bridge [1339].Bridging [952, 448]. Brief [539].BrlGraphEditor [1033]. Broadcast[516, 1216, 624, 672, 613]. Broadcasting[617, 1271, 631]. Broadcasts [490].Browser [405, 972, 1469, 1023, 1003, 1565].Browsing [471]. Bruijn [617]. Buffering[1258]. Builder [1469]. Building[1006, 819, 827, 1548, 207, 1, 821, 707]. Built[1263]. Built-in [1263]. Bulk [1134].Bundling [26]. Burst [1596]. Bus[576, 774]. Business [935]. Busy [1484].Button [985]. Buyers [1538]. Byte [745].Bytecode [1421].

c [1153, 409, 968, 117, 1321]. C-E [1321].c-Means [1153]. Cache[1269, 357, 1140, 376, 685, 31, 1178].Cache-Oblivious [357]. Caches [1174].Caching [1406, 443]. CADP [751].Calculating [1447, 1328]. Calculations[848]. Calculi [752, 440, 445, 292]. Calculus[571, 436, 1425, 291, 298, 290, 797, 444, 1392,447, 1723, 453]. Calibration [184]. Call[407, 1126, 1617]. Call-Graph [1126]. Calls[1252]. Camera [184, 1555].Camera-Based [1555]. Can [790, 973].Candidates [891]. Canonical [306].Capabilities [1629, 1068]. Capability[1230]. Capacitated [1159]. Capacities[1620]. Capacity [1577]. Captioning [993].Capture [1126]. Card [745, 1495].Carrying [766, 767]. Cartographic [881].Case[1370, 1549, 739, 732, 167, 551, 590, 317, 101,116, 938, 1399, 1082, 840, 1480, 1463].Case-Based [840, 1463]. Case-Study [739].Cases [1412]. Cat [923]. Catalogues [1536].CATCH [1126]. Categorical [1712, 1687].Categorization [709]. Causes [1671].

6

CBIR [491]. CBR [1219]. CC4J [11].CDMA [1273, 1249]. cdma2000 [1262].Cell [1582, 1579]. Cells[1603, 1597, 1574, 111]. Cellular[1620, 367, 1643]. Centered [940]. Central[1595, 1596]. Centralised [1485]. Centric[1189, 457]. Century [1039]. Cerberus[268]. Certificates [1070]. Certification[788]. Certified [753]. CESR [246]. CFA[262, 243]. CFD [1202]. CG [820, 811, 817].CGIF [811]. CGLF [811]. CGWorld [824].Chain [1253]. Chains [542]. Challenge[1165, 839, 999, 463]. Challenged [1011].Challenges [1110, 470, 1090, 492, 941, 1085].ChaMeleons [223]. ChaMeleons-01 [223].Champion [160]. chan [193]. Chance [954].Change [1008]. Changing [1078]. Channel[624, 542]. Channels [1249, 762].Character [898, 563, 1274, 1518, 922].Characterisation [929]. Characteristic[875]. Characterization[30, 1595, 1596, 913]. Characterize [630].Characterizing [380, 1152]. Characters[856, 985, 1669]. Cheating [519]. Checker[740]. Checkers [1421]. Checking[744, 300, 312, 395, 1096, 758, 21, 1098, 1099,66, 798, 32, 795]. Checkpointing [1244].Chemical [1502]. Children[970, 972, 974, 973, 971, 969]. Chinese[1316, 987, 1321, 1518]. Chip [1223]. Choice[997, 1289]. Chordal [425]. Chromosome[1660]. Church [353]. Cipher [522, 524].Circuits [1585, 214]. Circular [1765, 430].Circus [754]. City [688]. Class[921, 120, 784, 590, 102, 912, 683, 894, 626,123, 530, 662, 1690]. Class-Dependent[921]. Class-Discriminative [912].Class-Independent [102]. Classes[598, 755, 526, 127]. Classification[899, 1441, 1427, 1521, 673, 748, 684, 561,1507, 1755, 866, 1656, 1500, 148, 1660, 1662,596, 891, 1703, 1518, 886, 662, 1448, 670,926, 1456, 1742]. Classifier[890, 1508, 697, 885, 1495, 683, 924].

Classifier-Independent [890]. Classifier/Proper [697]. Classifiers[1634, 1783, 710, 1689, 925, 1509, 922].Classify [1633]. Clausal [438, 1367, 784].CLDS [1381]. CLEF[1319, 1349, 1314, 1320, 1333, 1322, 1317,1318, 1321, 1334, 1328, 1339, 1329, 1332,1342, 1340, 1327, 1315, 1337, 1348].CLEF-2001 [1318, 1334, 1315].Clickstream [835]. CLIOH [500]. Cliques[652]. CLIR [1331, 1325, 1330, 1347]. Clock[1118]. Clockwork [253]. Closed [373].Closing [758]. Closure [294]. Cluster[1150, 616, 1487, 1185, 1264, 1255, 1118, 1709].Clustered [1173]. Clustering[1630, 1487, 150, 887, 1460, 1658, 485, 1525,854, 1153, 1303, 849, 918, 504, 1413, 1667,1580, 1465, 1722, 1512, 1653]. Clusters[1133, 1692, 1201, 1137, 1152]. CM[239, 269]. CM-Dragons’01 [239].CM-Pack’01 [269]. CMOS [182]. CMU[254]. CNF [778]. Co[1419, 611, 1321, 1443]. Co-evolutionary[1443]. Co-occurrence [1321].Co-orthogonal [611]. Coach [233, 173].Coaching [173]. Coarse [1143, 1224].Coarse-Grain [1143]. CODACS [1179].Code [739, 1127, 766, 745, 106, 749, 1210,1273, 11, 80, 767, 788, 753]. Codebooks[56]. Codes [412, 611, 360, 1261, 535].Codification [1620]. Coding[495, 1597, 709, 1519, 1772]. Coefficient[561]. Coevolution [926]. Cognitive[190, 1611, 1052, 1740]. Coherence[1574, 1178]. Collaboration [1083].Collaborations [103]. Collaborative[1300, 1481]. Colleges [1082]. Collision[1245, 625]. Collocation [696]. Color[881, 182, 666, 200, 681, 1520, 480, 477].Coloring [603, 1235, 567]. Colour[1422, 495, 860, 905]. Columnsort [1411].Combination [222, 792, 897, 863, 1766, 924].Combinatorial [1237, 53, 128, 1402, 613].Combined [1315]. Combiners [885].

7

Combining [1419, 310, 1508, 666, 751, 710,770, 575, 286, 1583, 788, 793, 453].Commands [1011]. Commerce[1469, 1479, 1471, 713, 1472]. Commercial[741]. Committee [1636]. COMMON[85, 853]. Communication[1130, 632, 1133, 1589, 1285, 1037, 1483, 1553,1043, 1206, 282, 748, 940, 1242, 352, 1466,986, 1564, 624, 414, 1194, 1217, 1067, 946].Communications [1186]. Communicative[1536]. Community [1082]. commutative[563]. Comon [1749]. Compact[602, 869, 527]. Compactly [1685].Comparable [1324]. Comparative[1305, 1494, 690, 1174, 1268]. Comparing[381, 1080, 1318, 1586, 861, 1345].Comparison [183, 1014, 853, 643, 1429,1782, 885, 465, 1496, 1518, 886, 670].Comparisons [1569]. Compatibility[124, 848]. Compensate [968].Competencies [981]. Competitions [167].Competitive [1724, 1136, 1713, 1142].Compilation [125, 1138, 1173, 756].Compiler [768]. Compilers [1138].Complementarity [597]. Complete[419, 420, 878, 396]. Completeness[799, 441, 1385]. Completion [1681].Complex [1582, 723, 1603, 807].Complexities [130, 134]. Complexity[90, 131, 550, 359, 351, 1498, 386, 629, 797,1718, 342, 1156, 414, 892, 133, 38].Component [468, 10, 669, 1744, 1749, 1651,6, 1116, 684, 1505, 18, 1364, 16, 3, 14, 5, 1230,1769, 1716, 334, 119]. Component-Based[669, 684, 1364, 334]. Components[13, 325, 1197, 1708, 1, 19, 902, 335, 110, 1742].Composable [103]. Composition[746, 336, 1546, 716, 123, 301]. Compound[711, 1322]. Comprehension [465].Compressed [637, 1403]. Compression[56, 78, 79]. Compromise [642].Compromises [1371]. Computable[422, 601, 141]. Computation[872, 381, 551, 520, 1431, 374, 555, 361, 547,

341, 1672, 557, 1157]. Computation-Based[555]. Computational [1351, 553, 386, 1250,18, 70, 1356, 1610, 342, 1462, 845, 1389].Computations [1143, 1106, 391].Computer [1016, 571, 185, 1030, 987, 1555,673, 1167, 1398, 973, 979, 981, 945, 1019,941, 806, 582, 976, 576]. Computer-Aided[979]. Computers [1200, 1160, 969].Computing [72, 1549, 1108, 1226, 614, 537,778, 1238, 1559, 1547, 1548, 1551, 1557, 1244,845, 597, 1560, 1556, 1172, 1562]. Concept[829, 819, 813, 809, 806, 833, 830]. Concepts[146, 819, 827, 136, 831, 1111, 39].Conceptual [805, 1301, 823, 814, 826, 812].Concerns [322]. Concluding [718].Concurrency [117, 1094, 101]. Concurrent[1119, 1357]. Condition [1623].Conditional [647]. Conditioned [437].Conditioning [1705]. Conditions [301].Conductances [1607]. Conducting [1538].Confidence [1168]. Configurable [226].Configuration [1560]. Conflicts [532].Confluent [447, 305]. Congestion [1214].Conjectures [572]. Conjugate [1786].Conjunctions [359]. Conjunctive [66].Connected [853, 618]. Connection[771, 1777, 447, 1385]. Connection-Based[771]. Connectionist [1619, 1612].Connections [583]. Connector [12].Considering [196]. Consistency [148].Consistent [147]. Consonant [672].Consonant-Vowel [672]. Consortium[933]. Conspiracy [1162]. Constant [361].Constant-Round [361]. Constantly [1078].Constrained [1130, 1488, 3, 2]. Constraint[1440, 375, 614, 549, 441, 374, 53, 1395, 566,552, 1357, 1369, 59]. Constraints [307, 550,1308, 52, 567, 42, 344, 1759, 178, 1380].Construct [509]. Constructing[588, 98, 637, 724]. Construction[802, 701, 741, 28, 1151, 770, 355, 1725].Constructions [1425]. Constructors [310].Constructs [62]. Content[493, 288, 507, 1567, 957, 490, 479, 904, 871,

8

1566, 1255, 504, 496, 492].Content-Adaptive [1255]. Content-Based[493, 288, 507, 479, 904, 871, 504, 496, 492].Contents [1469, 716]. Context[1768, 790, 82, 827, 1675, 1559, 1523, 1544,306, 938, 397, 833, 1288]. Context-Free[397]. Context-Rich [1544].Context-Sensitive [790, 306, 938].Contexts [559, 828, 17, 575]. Contextual[990, 915, 1460, 860, 808]. Continuous[1788, 706, 1626, 1732, 1515, 1264, 1745, 566,925, 1543, 707]. Continuous-State [1788].Continuum [37]. Contract [2].Contract-Based [2]. Contracting [391].Contractions [1049]. Contrast [1689].Contrastive [1637]. Control[407, 1768, 1214, 1171, 749, 194, 757, 1216,1485, 1604, 585, 1698, 1695, 202, 1270, 1257,352, 1542, 1265, 43, 170, 978, 1585, 1178,962, 1771, 214, 161]. Control-Flow [749].Controlled [1162]. Controller [553].Controllers [197, 1706]. Convergence[1212, 1734]. Conversation [467, 717].Conversion [692]. Convex [131, 1157].Convey [1025]. Convolutional [1754].Convolutions [1727]. Cooperation [215].Cooperation-Based [215]. Cooperative[459, 168, 206, 821, 174]. Coordinating[1276, 1475, 1716]. Coordination[156, 1534, 50, 1277, 1570, 1243]. CoPS[255]. CoPS-Team [255]. Copyright[999, 535]. Coq [1420, 1430, 1438]. CORBA[16]. Core [1411, 1097]. Corel [474].Corpora [721, 725]. Corpus[1325, 1324, 672]. Correct [1155, 70].Correcting [1256]. Correction [1502].Correctness [182, 741, 1433]. Correlated[1608, 1605]. Correlation[1731, 674, 539, 924]. Correlations [931].Correspondence [387]. Correspondences[900]. Cortex [1613, 674, 1579]. Cortical[1603, 1591, 1609]. Corticospinal [1604].COS [522]. Coscheduling [1135]. Cost[189, 196, 1123, 1467, 678, 845, 1118, 889,

1747]. Cost-Sensitive [678]. Costs[1408, 1207]. COTS [1118]. Counter[770, 656]. Counter-Model [770].Countermeasure [542]. Counting[651, 358]. Coupled [1581, 477]. Coupling[1210, 683]. Courses [980]. Covariance[893]. Cover [426]. Coverability [731].Coverage [11]. Covering [414]. Coverings[652]. cp [1664]. CPG [1585]. Crawler[462]. Crawling [1470]. CREAM [1299].Create [974]. Creating [1047, 1221].Credit [1495]. Credulous [1387]. Criteria[954]. Criterion [170]. Critical[1751, 621, 1389, 321]. Critics [1429].Critique [1382]. CrocaRoos [234]. Cross[1707, 1684, 1321, 1343, 1324, 1326].Cross-Language [1321, 1343].Cross-Lingual [1324, 1326]. Cross-Point[1707]. Cross-Validation [1684]. Crossing[620]. Crossover [1631]. Cryptanalysis[522, 524]. Cryptographic [360].Cryptographically [746]. Cryptosystem[525]. Cryptosystems [612, 527]. CS[168, 203, 158]. CSL [1098]. CSP [392, 738].Cue [903]. Cues [670]. Culture [319, 1078].cum [1267]. Cumulant [1744]. Cuneate[1601]. Current [1592]. Current-to-Rate[1592]. Curricula [582]. Currying [308].Curvature [863]. Curve [528, 610, 527].Curves [494, 526, 634]. Customizable [1].Customization [1566]. Customized [71].Cut [434, 1426, 914]. Cut-Elimination[434]. Cuts [619]. CV [672].Cyberoos’2001 [224]. Cycle [1227, 397].Cycle-Free [397]. Cycle-Stealing [1227].Cyclic [985]. Cylindrical [639].CYNTHIA [1003].

D [493, 872, 1761, 1036, 1273, 1251, 842,1039, 1201, 639]. D-Meshed [1251].DAISY [933]. Data[781, 1633, 1748, 371, 1647, 518, 1193, 1731,1687, 755, 399, 1677, 1569, 843, 383, 1305,1297, 726, 839, 398, 1628, 1461, 589, 836,

9

1473, 740, 1151, 1517, 1444, 896, 1262, 1745,676, 1474, 1147, 1563, 1153, 1253, 1302, 1303,894, 564, 345, 1148, 1446, 1154, 1709, 918,892, 919, 1395, 1667, 596, 1450, 1178, 1443,1442, 138, 1310, 1448, 1179, 1638, 1653].Data-Parallel [1193]. Database[1311, 712, 483, 1296, 1451, 1149, 1177, 463].Databases [715, 493, 459, 696, 642, 810,836, 1147, 682, 1300, 1380]. Datalog[1378, 62]. Datasets [1507]. DAWG [89].Day [1496]. DBMS [1302]. DCGs [1396].DCT [482]. DCTP [455]. DDDLIB [772].De-noising [1688]. De-warping [877].Dead [694]. Dead-End [694]. Deaf [992].Deafblind [1043]. Debugger [1117].Debugging [65, 346]. Decidability[294, 396]. Decidable [1381, 349, 309, 784].Deciding [770, 410]. Decision[856, 921, 310, 1240, 1511, 192, 144, 792, 904,1650, 27, 1151, 337, 443, 1513, 1578, 236,873, 765, 1442, 1532, 1636, 1512, 1152, 45].Decision-Making [337].Decision-Support [1152]. Decisions[29, 864]. Declarative [69, 1379]. Decoding[680, 360, 1606]. Decomposition[1707, 1507, 635]. Decompositions [1294].Decorrelation [1757]. Decoupled [1739].Dedicated [1137, 1135]. Deduction[436, 551, 1431, 66, 1396]. Deductive[781, 1380]. Deep [224, 1114]. Defeating[545]. Deficient [939]. Deficits [968].Definite [725]. Deflection [1212].Deforesting [63]. Degenerate [1412].Degradable [615]. Degree [392, 1079].Delay [1252]. Delayed [1155, 1197, 1571].Delayed-Initiation [1155]. Delays [1587].Delegation [1287, 103]. Delegations [532].Delivering [1004]. Delivery [1087, 1543].Demand [1220, 585, 1161, 1179].Demand-Data [1179]. Demand-Driven[1161]. Demonstrations [341].Demonstrative [705]. Demonstrator[494]. Dendrites [1713]. Density[1720, 1495, 1649]. Depend [1631].

Dependable [632, 747]. Dependence[1109, 1486]. Dependencies [330].Dependency [1294]. Dependent[921, 757, 1576, 1523, 1713, 1436].Deployment [18, 3, 2, 7, 15]. Deposition[1166]. Depth [358]. Derivation[584, 1362, 557]. Derivational [305].Derived [1435]. Deriving[90, 746, 1100, 292]. Descendants [295].Descent [212, 1786]. Describing [762].Description [1779, 268, 856, 278, 230, 276,227, 262, 235, 243, 233, 1377, 223, 238, 231,712, 242, 764, 270, 225, 271, 776, 157, 255,226, 259, 236, 232, 284, 902, 244, 786, 247,254, 218, 788, 264, 228, 774]. Descriptions[1031, 725]. Descriptive [584]. Descriptor[487]. Design [1232, 737, 1212, 1204, 188,190, 553, 972, 423, 1012, 193, 940, 1270,1455, 1531, 1058, 981, 966, 116, 171, 1011,1236, 281, 457, 1536, 324, 214, 215, 462].Design-Centric [457]. Designing[1038, 1030, 940, 1544, 163, 1196]. Designs[1146]. Despite [1571]. Destructive [61].Detail [814]. Detect [1697]. Detecting[875, 688, 1692]. Detection[179, 1143, 1492, 669, 1752, 1782, 673, 908,900, 625, 679, 681, 1495, 1754, 678, 209,1581, 1770, 1601, 914, 1089, 506, 687].Detector [1736]. Detectors [903, 1268].Determined [507]. Determining[1521, 1308]. Deterministic[139, 1219, 656, 375, 62, 1182]. Developing[189, 1534, 71, 986, 1076]. Development[876, 1281, 745, 719, 1398, 741, 1190, 1473,979, 338, 1272, 1364, 1260, 1609, 969, 775,760, 216]. Developments [1016, 560].Device [1014, 1032, 967, 1052]. Devices[537, 981, 14, 1057, 988, 1562]. Diagnosis[1483, 555, 30]. Diagram [1300]. Diagrams[1038, 1590, 27]. Dialog [714]. Dialogue[715]. Dialogues [1538]. Diatoms [850].Dictionaries [1009]. Dictionary[609, 1330]. Dictionary-Based [1330].Difference [102, 772]. Difference-Based

10

[102]. Differences [1631]. Different[155, 906, 1586]. Differential [1757].Differentially [1662]. Differentiation[1433]. Difficulties [972]. Diffie [538].Diffusion [1593, 477]. Digit [897]. Digital[968, 1783, 995, 500, 998, 933, 991, 993, 492,534]. Digraphs [617]. Dimension[152, 894]. Dimensional [1748, 495, 1731,642, 1522, 95, 1465, 596, 1654, 1142, 1691].Dimensionality [677]. Dimensions[633, 387, 128]. Direct [777]. Direction[1594]. directional [1325, 209, 175].directional/Pin [179]. Directions[1353, 1786]. Dirty [233]. Disabilities[987, 1081, 981, 1008, 934, 1070, 1075, 936,959, 962, 984, 976]. Disabled[1061, 942, 999, 973, 940, 1005, 1068, 986,971, 1076, 938, 948, 969, 996, 941, 977].Disaffected [961]. Disagreement [145].Disambiguation [1325, 1538, 695].Disappearing [941]. Disaster [281, 165].Disconnection [444]. Discontinuity [704].Discourse [1616]. Discourses [838].Discover [1443]. Discovering [1277, 1444].Discovery [77, 1561, 1282, 1461, 836, 1147,54, 1454, 1452]. Discrete[1522, 1234, 1745, 610, 344, 55, 1759].Discretization [1515, 33]. Discriminant[890]. Discriminate [879]. Discrimination[923, 1601]. Discriminative [1245, 912].Disease [555]. Disenrollment [516].disjoint [453]. Disjunctive [1368].Disorder [975]. DISPARA [721].Disparity [1771, 874]. Display[1426, 1032, 967]. Displayed [1765].Displays [1002]. Dissimilarity [892].Distance [609, 1140, 1241, 94, 1697, 1235,604, 893, 1210, 1584, 851, 84, 1071, 1722].Distance- [1235]. Distance-Based [1140].Distance-Hereditary [604].Distinguishability [542]. Distinguishable[847]. Distinguished [1203, 1239].Distinguishing [403]. Distortion [912].Distributed [1589, 464, 1108, 511, 6, 1220,

4, 1483, 1485, 1239, 1183, 1147, 1265, 1557,1180, 100, 1000, 1299, 1089, 1113, 462, 774].Distributing [721, 1187]. Distribution[862, 92, 376, 1567, 1655, 1255, 1635, 867].Distributions [495]. Distributive [448].Disturbances [1129]. Divergence[1637, 389]. Diversity [1261]. DMSumm[727]. DNA [614, 1662, 597]. DNF [657].Do [735, 577]. Do-It-Yourself [577].Doacross [1141]. Document[899, 1311, 857, 1460, 726, 1729, 1343, 1462,1000, 1465, 1693, 877]. Documents[458, 819, 1045, 1047, 1025, 1004, 933, 1656,1013, 1463, 1457]. Does[101, 1631, 1599, 68]. Dog [923]. Domain[1651, 717, 482, 1360, 1547, 204, 283, 575,320, 527, 1456, 1209]. Domains[1441, 533, 1488, 798]. Domination [618].Door [1078]. Doors [1065, 1006]. Double[1193, 1220]. Double-Scan [1193].Doubling [542]. Down [865]. Dozen [233].DPDA [410]. Dragons’01 [239]. Drawings[646, 1034]. drilling [1455]. Driven[732, 708, 1608, 323, 1161, 1179, 1638, 858, 45].Driver [338]. DS [1249]. DS-CDMA[1249]. DSP [1256]. DTDs [1301]. DTSpin[758]. Dual [1215]. Dual-LAN [1215].Dual-Path [1215]. Dummett [770].Duration [436, 698]. during [1195, 564].Dutch [1331, 1336, 253]. Dynamic[120, 1726, 1619, 1409, 6, 1567, 26, 9, 393,1216, 1629, 1185, 580, 927, 1576, 1515, 1469,581, 1303, 1148, 1537, 211, 24, 504, 1405,108, 1753, 762, 1136]. Dynamical [1695].Dynamically [103]. Dynamics[1788, 1768, 1748, 1587, 1591, 1571]. DZB[998].

E-commerce [713, 1472]. E-learning [957].E-mail [1466, 1489]. E-marketing [837].eAccessibility [934]. Each [1080]. Eagle[280]. Easily [1002]. Easy [955]. eBusiness[457]. ECDL [1074, 1071]. ECDL(R)[1070, 1072]. Eclectic [1059]. eCommerce

11

[937]. Economical [88]. Edge [1772, 1601].Edges [200]. Edinburgh [795]. Edit[609, 851, 84]. Editor [1024]. Education[951, 1080, 950, 947, 945, 1071].Educational [954]. Edutainment [961].EEG [1752, 1732, 1750, 1755]. eEurope[934]. Effect [1169]. Effective[120, 387, 1495, 977, 1715, 1315]. Effectively[1051]. Effects [1322, 1593, 734, 891].Efficiency [301]. Efficient[1779, 493, 77, 872, 104, 1266, 182, 1420, 357,518, 495, 1567, 622, 439, 1239, 604, 625, 1520,612, 427, 637, 1244, 1414, 1673, 1554, 15, 789].Efficiently [1741]. Effort [26]. Eidetica[1338]. Eigen [264]. Eigenspace [854, 910].Eigenspace-Based [910]. Eigenvectors[893]. ELAN [303]. Elastic [1720].Elderly [942, 940, 1053, 941]. Electric[204, 667]. Electricity [1496]. Electronic[744, 1059, 1479, 996]. Elementary [420].Elimination [434, 552]. Elliptic [528, 610].EM-Based [1668]. Email [1454, 1456].Embeddable [71]. Embedded[745, 664, 1557]. Embedding [829, 769].Emergent [1482]. Emerging [942, 941].Emotional [1017]. Emotive [993].Empirical [686, 724]. Employing[573, 992, 1163]. Employment [959].Enabled [1233, 1758, 1230]. Enabler [1007].Enabling [457, 15]. Encode [1618].Encoded [1447, 1586]. Encoder [1222].Encoding [122, 80, 1602]. Encodings [439].Encrypted [518]. Encryption [530]. End[694]. Energy[371, 622, 1642, 625, 624, 1771].Energy-Efficient [622, 625]. Enforcing[1178]. Engineering[288, 325, 113, 316, 339, 1504]. Engines[729]. English [1331, 811, 1316, 1321, 1339].English-Dutch [1331]. Enhance[328, 1576]. Enhanced [673].Enhancement [838, 865, 1267, 477].Enhancing [1061]. Ensemble [1661, 689].Ensembles [1630]. Ensuring [1182].

Enterprise [17, 5]. Entropic [1621].Entropy [710, 128, 695]. Entropy-Based[695]. Entry [990, 234]. Enumeration [654].Environment[72, 1552, 1305, 1015, 454, 1116, 1258, 1296,1183, 1041, 54, 1, 1154, 1725, 577, 1299, 1267].Environment-Aware [72]. Environments[1189, 1112, 1476, 1548, 151, 211, 3, 1560,962, 177, 15]. Epilepsy [1609]. Episodes[1735]. Episodic [1612]. Epsilon [452].Equal [649]. Equal-Flows [649]. Equality[444]. Equation [1166]. Equational[1101, 294]. Equations[1200, 1145, 347, 1203, 783, 1097].Equilibria [351]. Equipped [1032].Equivalence [1145, 409, 64, 1437, 410].Equivariant [343]. Erlang [739]. Error[686, 1752, 1372, 1735, 1663].Error-Tolerant [1372]. Errors[781, 1045, 1256]. ESAPS [339]. ESC [744].ESC/Java [744]. Essence [418]. Essex[270, 225]. Establishing [1306, 320].Establishment [762]. Estimate[893, 1635, 1734, 1494]. Estimated [250].Estimates [1663]. Estimating [1563, 867].Estimation [1684, 1123, 859, 198, 1228,1648, 1691, 1652, 1714, 174, 1771, 471, 1562].Estimations [1513]. Estimator [1743].ESTs [76]. Eternity [587]. Ethernet[1215]. EU [1056]. Euclidean [423]. EUN[947]. Europe [1080]. European[1086, 952, 999]. Eurospider [1320].Evaluate [950]. Evaluated [1337].Evaluating [507, 828, 1405]. Evaluation[1031, 989, 1305, 1109, 751, 1294, 1213, 203,1347, 1531, 981, 1197, 1120, 474, 1410, 816,508, 1533, 1346]. Evaluational [953].Evasion [417, 183]. Event [113, 1392].Event-Based [113]. Events [1189].Evidence [887, 198, 863]. Evolution[331, 4, 1620, 119]. Evolutionary[1491, 1659, 1696, 674, 332, 178, 1443].Evolving [197, 1078, 1450]. Exact[381, 143, 74, 95]. Example

12

[1431, 1069, 864, 858]. Example-Driven[858]. Examples [90, 608, 968]. Exception[1195]. Exceptions [291, 451]. Exclusion[1181, 623]. Executable [1420]. Executing[166, 1541, 1169]. Execution [1543].Exemplified [954]. Exercise [588]. Exeter[1317]. Existence [134]. Existential[829, 833]. Expansion [898, 1327, 1326, 984].Expeditious [1464]. Experience[838, 1066, 1028]. Experiences[940, 1027, 971]. Experiment [1523, 1309].Experimental[1409, 643, 1330, 1406, 1604, 465, 1410, 341].Experiments[895, 1320, 1317, 1329, 1332, 1315, 1348].Expert [555, 1453, 914]. Expertise [1466].Explicit [1425, 298, 848]. Exploitation[58]. Exploiting [1698, 1169]. Exploration[737]. Exploratory [1603, 1516, 1674, 919].Exploring [143, 1034]. Explosion [839].Exponential [357, 362]. Exponentially[1605]. Exponents [520]. Expressed [1662].Expression [1633, 561, 1667, 1653].Expressions [1024, 98, 1023, 699, 817].Expressive [764]. Expressively [420].Expressiveness [550]. Extended[1125, 621, 611, 1418, 617, 638, 650, 1739,1103, 601, 1701]. Extending[605, 761, 916, 825]. Extensible [164].Extension [574]. Extensional [297].Extensions [1225]. Extracting[73, 74, 499]. Extraction [1632, 1459, 708,1710, 1520, 1646, 1505, 1671, 1524, 1457].Eye [980]. Eyeshot [156].

F [327]. F180 [184, 243]. Face[562, 1781, 669, 1782, 908, 906, 900, 684, 907,1520, 909, 43, 678, 486, 677, 910, 506, 687].FACERET [486]. Facilities [667]. Factor[1109, 1734, 1494, 1217]. Factorial [1759].Factorization [1199, 78]. Factors [321].Facts [1109]. Fading [1249]. Failure[1361, 1089, 1248]. Failures [101]. Fairness[1095, 1267, 1182]. False [1533].

False-Name-Proof [1533]. Families[349, 339, 833]. Family [316, 321]. Fast[416, 632, 187, 616, 663, 520, 1778, 95, 1216,917, 398, 162, 916, 1158, 501, 521, 269].Fastap [1551]. Faster [93, 348, 795].FASTY [983]. Fatigue [1742]. Fatique[930]. Fault [1184, 1231, 1251, 641, 1089].Fault-Tolerant [1184, 1251, 641, 1089]. Fax[479]. FC [226]. Feasibility [1550]. Feature[890, 921, 1508, 1582, 1720, 694, 329, 1521,857, 1572, 330, 328, 1646, 1505, 849, 889,502, 1657, 891, 1670, 695, 874, 926, 1638].Feature-Based [694, 329]. Features[1510, 824, 482, 330, 1021, 906, 1525, 499,889, 677, 1532, 1528, 1766]. Feautrier[1144]. Federated [459]. Feedback[1727, 977, 1324, 1571]. Feedforward [1784].Fei [181]. FFT [1201]. FG [1267]. FG-LIW[1267]. Fictitious [1470]. Field[1768, 204, 1587, 14, 1625]. Fields[511, 666, 1574]. Fighters [240, 241]. File[484, 1173]. Filter [1701]. Filtering[1306, 1501, 462, 1489]. Filters [1675, 1739].Filtersfor [94]. Financial[1733, 1498, 1760]. Find [916]. Finding[424, 92, 399, 88, 1745, 1662]. Finds [200].Fine [585]. Fingerprint [1775].Fingerprinting [535]. Fingertip [1018].Finite[782, 411, 706, 347, 440, 1623, 409, 628, 1588].Finite-State [706]. FIPA [1283]. FIPA-OS[1283]. Fire[1165, 1592, 1605, 1588, 1713, 1580, 284].Firing [1598, 1605]. First[434, 349, 550, 1383, 940, 773, 326, 823, 160,1403, 1384, 566]. First-Order[434, 550, 1383, 773, 326, 1384, 566].Fıschlar [492]. Fisher [1693]. Fishes [913].Fitness [1631]. Fitting [882]. Fixpoints[1371]. Flat [1357]. Flexible[714, 574, 226, 15, 984]. Flipping [636].Floor [175]. Flow[1590, 749, 1467, 1542, 391, 1172]. Flows[621, 1219, 649]. Fluctuations [1598]. Fly

13

[1773]. fMRI [1569]. fMRI- [1569]. Focus[578]. Focused [1470, 292]. Focuses [1776].Focusing [1741]. Focussing [802]. Folds[592]. FOOM [465]. Football [260].Forecasting [1493, 1496]. Forests [1650].Forgotten [1109]. Form [1522]. Formal[125, 1424, 732, 1417, 745, 744, 792, 813, 748,28, 1432, 831, 396, 768, 806, 756].Formalised [1426]. Formalism [820].Formalisms [761]. Formality [741].Formalized [811, 1438].Formalized-English [811]. Formalizing[1427, 34]. Formally [746]. Format [1047].Formation [1603, 573, 236]. Forms [1576].Formulae [300, 1098]. Formulas[40, 780, 778, 443, 724, 828, 38].Formulations [1392]. Forward[755, 680, 693, 477]. Foster [1070].Foundations [570]. Foundedness [799].Four [633, 266]. Fourier [1522, 1158].Fourth [1756]. FPGA [185]. FPGA/VHDL [185]. FPGA/VHDL-Based [185].Fractal [1787]. Fractional [1745].Fractographs [930]. Fragment [442].Frame [491, 811, 1683]. Frame-CG [811].Frames [503, 502]. Framework [125, 989,186, 6, 71, 709, 1270, 1517, 337, 1265, 32,1011, 164, 910, 1230, 795, 1506, 1490].Frameworks [1263]. France [243]. Fraud[1495]. Free [781, 1155, 1428, 650, 397].Free-Style [1428]. Freeway [1737]. Frege[358]. Freiburg [168, 203, 158]. French[271, 1339]. Frequent [1440, 399].Friedberg [1027]. FTB [1175]. FU[240, 241]. FU-Fighters [240, 241]. Fuel[1649]. Full [550, 607]. Fully [1183, 1303].Fun2Mas [256]. Function [1707, 782, 605,1684, 558, 847, 1592, 1659, 1658, 1036, 422,1623, 127, 1691, 1643, 1052, 1701, 1668].Functional[381, 1423, 1677, 751, 1294, 580, 554, 1586, 61].Functions [1624, 494, 572, 1735, 742, 592,172, 601, 539, 397]. Funeral [483]. Fusing[1776, 1453]. Fusion

[885, 903, 257, 922, 1649]. Future[167, 1085]. Futures [1492]. Fuzzy[1632, 1639, 1511, 1521, 197, 1153, 1513,1443, 1442, 1477, 1452, 1506, 1659].Fuzzy-Neural [1511]. FX [1491].

Gait [1627, 979, 975]. Galois [583]. Game[46, 415, 351, 236, 250, 1279]. Games[183, 970, 400, 156, 25, 974, 380, 296, 1481].Ganglion [1597]. Gap [952, 1550]. Gapped[94]. GARCH [1501]. Gardening [963].Gas [1723]. Gateway [1260]. Gaussian[882, 1704, 1733, 1493, 929, 883, 884]. Gear[1455]. Gemplus [744]. Gender [670].Gene [1633, 92, 1667, 1653].Gene-Expression [1633]. General[73, 151, 1151, 1517, 1359, 450, 1137, 1438].General-Purpose [1137]. Generalised[556, 201, 759, 391, 1157]. Generalization[1101, 131, 1629, 1663, 661, 44].Generalized [1487, 855, 617, 547, 910].Generated [494]. Generating [1584].Generation [781, 782, 787, 441, 1383, 1566,1175, 816, 743, 1638, 1348]. Generative[1620, 1755]. Generator [1204, 513, 1540].Generators [1595, 1596]. Generic[10, 1605, 575]. Genes [1662]. Genetic[1514, 191, 1521, 561, 1251, 1631, 919, 1657,1442, 568]. Genetic-Based [568]. Genome[76]. Genomes [595]. Genomic [839].Genus [526]. Geometric [371, 129, 1738].German [1336, 998]. GermanTeam [272].Getting [1411]. GF [612]. GHC [1357].Giessen [1027]. Giessen-Friedberg [1027].Gigabit [1208]. Gilgul [9]. GIRT [1333].Glass [666]. Glass-Markov [666].Glaucomatous [866]. Global [156, 168,1296, 1183, 345, 1581, 240, 1178, 512].Global-Locally [1581]. Gloss [1345].GMD [258]. GMD-Robots [258]. Goal[1725]. Goalkeeper [163]. Godel [434, 770].Godel-Dummett [770]. Goes [192, 998].Going [1552, 1040]. Gone [1059]. Good[416]. Gossiping [372, 631]. Governance

14

[333]. GPS [1015]. Graded [797]. Gradient[1757, 1678, 212, 1786]. Gradual [767].Grain [1143, 1224]. Gram [94, 1685, 1322].Grammar [697, 699, 78, 846].Grammar-Based [699, 78]. Grand [1165].GrAnDe [786]. Graph [619, 1307, 1126,850, 860, 844, 871, 1702, 854, 849, 823, 368,869, 851, 1385, 652, 848, 868, 812].Graph-Based [844]. Graphical[1510, 314, 924]. Graphics [1031, 1033, 858].GraphPlan [49]. Graphs[417, 1408, 1401, 702, 853, 400, 390, 620, 349,697, 829, 819, 621, 618, 603, 813, 567, 604,832, 1129, 809, 814, 653, 348, 808, 816, 826,1404, 867, 425, 833]. GRASP [1236]. Gray[929]. Gray-Level [929]. Greedy[1679, 584, 148, 1533]. Grid[1232, 1226, 850, 645, 1154, 1230, 1250, 1111].Grid-Computing [1226]. Grid-Packing[645]. Grids [18]. Ground [783].Groundwork [719]. Group[525, 352, 517, 1089]. Grouped [889].Groups [616, 347]. Growing [1723].Guaranteed [1267]. Guaranteeing [1264].Guarantees [150]. Guarded [442]. Guards[120]. Guide [573, 976]. Guided [1390].Gurmukhi [878].

H [1502]. H.26L [1222]. Habitat [1058].HAL [975]. HAL-3 [975]. Halfspaces [608].Hamiltonian [604]. Hammerheads [254].Hamming [1631]. Hand [563, 1669].Hand-Written [563, 1669]. Handicapees[1058]. Handicapped [1003]. Handling[1195, 1301, 1300]. Handoff [1257].Handwriting [1639]. Handwritten[898, 897, 869, 922]. Haptic [1036, 1052].Hard [660, 401]. Hardness [392, 360].Hardware [185, 1626, 1126, 1190, 1178].Hardware-Amenable [1626].Hardware-Software [1178].Harmonisation [999]. Hashing [1168].Haskell [585]. HAVAL [541]. Having [349].Head [980, 967]. Hearing [968, 967].

Hebbian [1674]. Heilbronn [633]. Helli[227]. Helli-Respina [227]. Hellman [538].Help [1015, 1054, 716]. Helpdesk [1617].Helping [716]. Herbrand [783].Hereditary [604]. Heteregenous [239].Heterogeneous[1650, 1296, 251, 1374, 221, 1310].Heteroscedastic [894]. Heuristic[47, 732, 27, 1236, 58]. Heuristic-Driven[732]. Heuristically [350]. Heuristics[1401, 696, 91, 779]. Heuristics-Based[696]. Hidden[1459, 1671, 1523, 1759, 918, 1089].Hierarchical [1133, 931, 1781, 150, 1460,726, 1449, 1461, 1517, 865, 208, 487, 1770,35, 1217, 1703, 1766, 1676]. Hierarchically[1526, 1456]. Hierarchies [122, 1453, 123].Hierarchy [354, 413]. High[1748, 1731, 1146, 1637, 1185, 395, 1138,1210, 1160, 1154, 175, 922, 1649, 1172, 1108].High-Accuracy [1637]. High-Availability[1185]. High-Dimensional [1748].High-Level [1146, 395]. High-Speed [175].Higher [1419, 796, 598, 309, 1418, 1356].Higher-Order [796, 1356]. Highest [1079].Highlighted [901]. Hilbert [452]. Hint[1140, 1500]. Histogram [929].Histogramming [398]. Histograms [1709].Historical [496]. HMM [680]. HMM/SVM [680]. HMMs [92]. HMPH [1058].Hoare [734]. Hoc [1241, 1240, 372]. HOL[773]. Hole [179]. Holmes [544]. Home[1260, 1055]. Hop [622]. Hopfield[1788, 1452]. Host [1164]. Host-Parasite[1164]. Hosted [1292]. Hough [928]. HR[787]. HTML [1003, 1463]. Huffman [412].Hull [1157]. Hulls [131]. Human[875, 906, 1627, 28, 595, 76, 1609, 1538, 1539].Human-Automation [28]. Humanoid[193, 161]. Hummingbird [1337].Hungarian [1050]. Huskies [276].Huskies-01 [276]. Hybrid[179, 777, 435, 1639, 680, 553, 1373, 1164,1118, 978, 55, 1114]. HyLoRes [777].

15

Hyper [632]. Hyper-rings [632].Hyperbalanced [290]. Hyperbolic [368].Hypercolumns [1600]. Hypercubes [1211].Hyperelliptic [526, 527]. Hypergraph[1310]. Hypergraphs [426, 427].Hypermedia [950]. Hyperparameter[1785]. Hyperresolution [784].Hypothesis [476, 30, 1774, 1654].

I-tracings [496]. I/O [1189]. ICA[1748, 1738]. iCAMS [1564]. iCLEF[1344, 1345]. ICT [951]. Id [181].Identifiability [1749]. Identification[1767, 1624, 850, 538, 912, 1747, 96, 1701,488, 1554]. Identify [616]. Identifying[87, 1474, 569]. IEEE [1099, 1254]. II[1596, 513, 157]. Illumination [909]. ILP[1173]. Image[1767, 182, 665, 495, 1582, 507, 494, 875, 476,857, 1572, 479, 482, 1778, 1765, 1762, 904,905, 1777, 871, 483, 909, 478, 1274, 487, 470,474, 1018, 503, 501, 56, 504, 1580, 477, 1769,471, 1764, 473, 481, 877]. Image-Pair [476].Imagery [1150, 491]. Images[493, 881, 507, 475, 1697, 1776, 873, 869, 496].Imagination [960]. Imaging [1586, 175].Immature [320]. Immediate [164].Immune [421, 539]. Impact [1335, 1069].Impaired[1016, 970, 974, 1047, 1015, 1010, 1020, 1080,1027, 1000, 967, 1007, 1001, 1071, 1057, 1009].Impairments [1030]. Impediments [693].Imperative [580]. Imperfect [46].Implementation [1401, 104, 565, 156, 190,1305, 1222, 1516, 1360, 442, 1270, 313, 1259,1531, 116, 1771, 214, 462].Implementations [1549, 746].Implementing[185, 1193, 1087, 580, 1727, 1302, 1119, 1230].Implicit [1788, 1394]. Importance [1736].Important [875]. Improve [198, 1083].Improved [1744, 393, 426, 406, 602].Improvement[1415, 1629, 1205, 1035, 301, 512].

Improvements [731]. Improves [1706].Improving [1189, 1307, 300, 1294, 981, 1141,1739, 391, 695, 956, 935]. In-memory [1177].Inalienable [701]. Inapproximability[347, 426]. Including [959]. Inclusion[963, 992]. Inclusive [1011, 945, 956, 956].Incomplete [895, 421, 437, 828].Incompleteness [451]. Incompressible[1202]. Inconsistent [1453]. Incorporation[915, 198]. Increase [1607]. Increased [182].Increasing [1752, 1059, 1263, 981, 1170].Incremental [827, 736, 1682]. Indefinite[560, 452]. Independence [1623, 653].Independent [890, 1744, 1749, 1651, 1168,102, 517, 1505, 902, 1764]. Index[763, 804, 834, 841, 932, 1088, 1105, 1246,1275, 1291, 1312, 1350, 1375, 1400, 1416,1439, 1529, 1545, 1568, 1790, 20, 60, 75, 99,126, 154, 285, 315, 340, 431, 456, 469, 510,548, 579, 594, 658, 691, 728, 1447, 1493, 1414].Indexed [589, 1175]. Indexer [1338].Indexing [726, 500, 1451, 1462, 480, 1326].indiGo [838]. Individual [1532, 1071].Individually [990]. Individuals [992].Indoors [1562]. Induces [1575]. Induction[1419, 551, 192, 1513, 45]. Inductive[1367, 554, 724, 138, 140, 576]. Inefficiency[1202]. Inequalities [772]. Inexact [854].Inference [1511, 561, 138, 1676]. Inferring[608, 139]. InfiniBand [1213]. Infinite[67, 395, 798, 1654]. Infinite-State [395].Infinity [571]. Influence [316, 1599].Influenza [840]. Information[288, 46, 1306, 1377, 666, 805, 1065, 1316,915, 1006, 1012, 955, 708, 942, 1597, 1043,1460, 1576, 952, 1559, 1069, 1183, 1479, 499,1272, 1068, 30, 1081, 1513, 1321, 1544, 809,1328, 1662, 170, 1336, 1454, 700, 1564, 1586,967, 1011, 722, 938, 1299, 1596, 58, 1672,1404, 1017, 934, 936, 1673, 1346, 133, 531,946, 463, 1457, 1668].Information-Theoretic [30]. Informing[984]. Infrastructure[1281, 957, 1476, 16, 1111]. Infrastructures

16

[515]. Infty [1029]. Inherence [397]. Initial[34, 1267, 234]. Initiation [1155].Initiatives [1005]. Inlining [121].Innovation [955]. Input[1598, 987, 985, 713, 1605, 1670, 1583, 1528].Inputs [1165]. INS [1561]. INS/Twine[1561]. Insecurity [542]. Insider [536].Inspections [1652]. Inspired [1573].Instant [1227]. Instant-Access [1227].Instantiation [329]. Institute [1027].Institutionalizing [319]. Instruction[302, 1225, 1167, 1170]. Instruction-Level[1167, 1170]. Instructions [1171, 105, 1169].Instruments [1086]. Integer [646].Integers [793]. Integral [908]. Integrate[1592, 1605, 1588, 1713, 1580].Integrate-and-Fire[1592, 1605, 1588, 1713, 1580]. Integrated[1102, 740, 561, 1300]. Integrating[570, 741, 1117]. Integration[1295, 1377, 560, 413, 1702, 444, 1018, 869,1585, 1070, 552, 1310, 324]. Intellectual[962]. Intelligence [1499, 1279]. Intelligent[1276, 1469, 1328, 837, 982]. Intensional[299]. Intentional [1561]. Inter[464, 1607, 1209]. Inter-domain [1209].Inter-organizational [464]. Inter-spike[1607]. Interaction[1642, 330, 859, 314, 54, 1278]. Interactions[1182, 1717, 1638]. Interactive[1038, 1227, 1342, 944, 486, 471].Interchangeable [1341]. Interconnection[1206]. Interdependence [1127]. Interface[1014, 1012, 940, 773, 966, 55, 1035].Interfaces [876, 815, 28, 981, 837, 982].Interference [1784, 747, 1268].Intermediaries [1243]. Internal[333, 1118, 138]. International [1083].Internet [1016, 1207, 1209, 1355, 1468, 350,980, 1004, 1445, 1255, 1250, 1271, 153, 111].Internetworked [1265]. Interoperability[464, 823]. Interpolation [1745, 610].Interpretation[880, 211, 966, 1103, 1747, 1612, 830].

Interpreter [314, 116, 1357]. Interpretive[1124]. Intersection [354]. Interspike[1595]. Interval [1607, 567, 1595, 81].Interventions [976]. Intraday [1491].Introducing [1193]. Introduction[1285, 1313, 1186, 959, 332]. Intrusion [673].Intuitionistic [769]. Invariance [1584].Inverse [1707, 606]. Inverting [592].Investigation [1325]. Investment [416].Invited [1090]. Invocation [1195].Involving [448]. IPC [1172]. IPSIS [1044].IR [1334, 1323, 1340]. IR-n [1334].Irreducible [652]. Irregular [1143]. irst[1319]. Isabelle [768, 1422, 1424]. Isabelle/HOL [1424]. Isabelle/Isar [1422].ISocRob [259]. Isomorphism [526]. Isotop[1719]. Issues [1108, 1393, 823, 1011].IT-Certificates [1070]. Italian [1336]. ITC[1319]. ITC-irst [1319]. Item [398]. Items[399, 644]. Iteration [1745]. Iterative[1203, 1734, 33, 1606, 894].Iterative-Refinement [33].

J [107]. J-Orchestra [107]. Japan[1080, 1046]. Japanese [965]. Java[1232, 125, 104, 745, 4, 1407, 105, 590, 11,768, 1187, 107]. Java-Based [1232].JavaBean [5]. JHU [1329]. JHU/APL[1329]. JITty [311]. JML [109]. Job [1131].Joint [1371, 166, 867]. JPEG [482]. JUnit[109].

K-Means [887, 1413]. k-NN [1508].Kalman [1675, 1739, 1701]. Kansei [1449].Karlsruhe [210]. KDD [1490]. Keep[1073]. Keepaway [176]. KENSEI [193].KENSEI-chan [193]. Kernel[1761, 1577, 680, 1681, 676, 129, 674, 661,690, 1682, 1688, 662, 1686, 888].Kernel-Based [1761]. Kernels[686, 665, 1685, 1683, 1693, 132].Kerneltron [668]. Key[515, 338, 612, 514, 529, 502, 543, 512, 1380].Keyboarding [987]. keying [514]. Keypad

17

[1551]. Keys [511]. Keystream [513]. KIF[811]. Kinematics [1707]. KISS [1073]. Kit[876]. Kleene [593]. Knapsack [365].Knowledge [1619, 815, 1391, 836, 1455,1147, 1458, 1504, 811, 437, 823, 1454, 446,1453, 807, 1452, 1562, 1457].Knowledge-Based [1457]. Known [1072].KnowWare [1040]. Koblenz [229].Kohonen [1778]. Kolmogorov [1645, 373].Korean [701]. KOSPI [1492]. Kowalski[1385, 1352]. Kyushu [266].

L [1131, 396]. Labeled [1457]. Labeling[1638]. Labelled [385]. Labour [1072].Labscape [1549]. LAESA [916]. Lambda[299]. LAN [1215]. Lana [112]. Landmark[1702]. Landmarks [1697]. Langley [1417].Language [715, 876, 1376, 466, 1311, 9,1393, 974, 1466, 1741, 1321, 1343, 742, 966,171, 965, 1221, 173, 61, 707, 1357, 762, 846].Languages[69, 354, 1355, 1042, 847, 137, 820, 1675, 1360,1188, 139, 353, 313, 355, 294, 1011, 1337].LANs [1254, 1268]. Large [1200, 706, 660,1220, 896, 1741, 1097, 1153, 1142].Large-Scale [1220]. Larger [1267].Latency [650]. Later [1418]. Lateral[1717]. Lattice [1593, 56, 292, 569].Lattices [819, 448]. Law [999]. Laws [350].Lax [769]. Layer [1721, 1262, 1166, 1677].Layered [635, 480, 293]. Layers [103].Layout [1045, 1142]. Lazarus [228]. Lazy[798]. LCF [773]. LCF-Style [773].Leading [1069]. League[184, 189, 159, 160, 266, 251, 234]. Leagues[155]. Leaky [1588]. Learn[987, 965, 39, 776]. Learnability [143, 657].Learned [900]. Learners [961, 140].Learning [1743, 838, 856, 1707, 1784, 1077,1589, 183, 1781, 48, 145, 146, 1626, 987,1733, 1493, 660, 1393, 819, 1491, 1476, 843,1615, 1572, 1642, 847, 137, 1640, 1367, 1637,1608, 1629, 1617, 1675, 1669, 1641, 1628,1507, 1519, 1080, 866, 1475, 1674, 127, 210,

977, 56, 1759, 1713, 153, 1730, 502, 948,1652, 1683, 35, 1789, 1694, 1700, 1763, 959,1753, 1503, 36, 176, 1583, 177, 1071, 852,670, 1625, 1766, 1481, 1486, 1539, 142, 957].Learnt [1453]. Least [1679].Least-Squares [1679]. Leave [1663, 1686].Leave-One-Out [1663, 1686]. Leg [978].Legacy [330]. Legal [1332, 1389]. Legged[159, 279, 197, 280, 267, 275, 266, 269].Legislating [1066]. Legislation [1069].Lemma [443]. Lempel [1519, 78]. Length[424, 92, 978, 305]. Lengths [304]. Less [26].Level [1143, 1720, 329, 1146, 1430, 1167,395, 911, 952, 929, 546, 1662, 3, 814, 1532,1170, 1541, 1404]. Levels [1742, 1764, 45].Levenshtein [94]. Levy [380]. Lexical[723, 1458]. Lexicon [697].Lexicon-Grammar [697]. Libbraille[1002]. Libraries [1005, 996, 471]. Library[1237, 500, 998, 1191, 772, 1002, 1008, 492,1001]. License [681]. Life [1539]. Life-Like[1539]. Lifetime [1240]. Lift [1072]. Light[791]. Like [1539]. Likelihood [1674, 873].LILI [513]. LILI-II [513]. Limb [1052].Limitations [1068]. Limited [161]. Limits[693]. Line [1266, 633, 319, 1639, 325, 329,644, 330, 645, 338, 337, 759, 326, 323, 327,335, 324, 320, 79, 322, 217]. Lineage [1297].Linear [419, 862, 85, 780, 1783, 476, 438,1640, 885, 139, 525, 1623, 517, 1097, 894,437, 136, 433, 1759, 892, 519, 1643, 1666,425, 1684, 561, 920, 37]. Linear-Threshold[136]. Linear-Time [438]. Linearly [807].Lines [331, 317, 333, 318, 336, 332]. Lingual[1324, 1326, 983]. Linguistic [720, 1462].Link [1249, 454]. Linkage [1665]. Linking[761, 505]. Linux [1044]. List [624]. Lists[1454]. Literacy [961, 1059]. literal [817].Literature [1610]. Little [729]. Live [1271].Live-Broadcasting [1271]. Liveness [1182].Living [1058]. LIW [1267]. Load[1128, 1161, 1169]. Loading [120]. Local[419, 464, 131, 156, 189, 1724, 1240, 1721,1669, 1451, 897, 1727, 1099, 86, 345, 503,

18

1405, 241]. Localisation [180, 212].Locality [1205, 1141]. Localization[1781, 205, 681, 209, 175, 269, 481].Localized [130]. Locally [1581]. Location[1563, 1564, 1562, 647].Location-Awareness [1563]. Locative[697]. Locker [739]. Locomotion[1014, 199, 1696, 1585, 1694]. Logarithm[610]. Logarithmic [375, 363]. Logfiles[164]. Logic [1370, 72, 1390, 434, 766, 435,390, 563, 1393, 1355, 1426, 438, 300, 65, 1366,1146, 769, 1367, 771, 420, 197, 1360, 1383,374, 773, 1373, 1353, 770, 70, 1364, 1356,326, 437, 433, 1368, 559, 828, 734, 808, 1389,1395, 557, 1477, 552, 1369]. Logic-Based[1373]. Logical [583, 1354, 74, 827, 795].Logicality [556]. Logician [1351].Logicism [1398]. Logics [419, 777, 288,1381, 1377, 439, 440, 71, 764, 445, 446, 450].LogP [1129]. LogP-Machines [1129]. Long[1031, 1615, 1210, 971, 1739]. Long-Term[1615, 1739]. LONGEST [85]. Longo [380].Look [609]. Look-Up [609]. Lookahead[43]. Loop [1143, 801, 1270]. Loop-Level[1143]. Loops [1139, 304, 1141]. Losing[1598]. Lost [1758]. Loveland [373]. Low[1031, 189, 1021, 1118, 1019]. Low-Cost[1118]. Lower [1663, 362, 855, 892, 142].Lower-Complexity [892]. LRP [271]. LS[1685]. LS-SVM [1685]. LSTM [1675].LuckyStar [157]. Lukasiewicz [445]. LVQ[1639]. Lyapunov [1200].

MAC [1245, 1262]. Machine[183, 1626, 843, 668, 1317, 689, 1455, 866,1692, 1652, 1682, 176, 1067, 1497].Machines [1785, 675, 1679, 680, 671, 106,664, 679, 1455, 1776, 1129, 678, 129, 659,661, 1690, 682, 672, 1132, 1614, 1625, 687].Macrocolumns [1578]. Macrostep [1437].Magic [1379]. Magnetic [1505, 1562].Mahalanobis [893]. mail [1466, 1489].Mailing [1454]. Mainstream [1026].Maintaining [1409, 534]. Maintenance

[1305, 1239, 667]. Mainz [230]. Make[736, 101]. Make-Based [736]. Making[572, 337, 1558, 1532, 1055, 994, 1636].MALLBA [1237]. Management[838, 714, 1499, 1733, 1185, 318, 1563, 1454,1443, 531, 463, 1489]. Manager[715, 468, 1477]. Managing [1298].Manifesto [844]. Manipulation [985].Manufacturing [635]. Many [1074, 891].Map[1726, 1720, 1711, 1728, 485, 1495, 1712,1718, 1708, 1715, 1465, 1722, 1562, 1494].Maple [572]. Mapping [709, 1723, 1137].Mappings [1623, 892]. Maps [1731, 1697,1721, 1778, 1460, 859, 1445, 63, 1727, 1040,501, 1581, 1709, 1730, 1502, 486, 1717].Margin [149]. Marine [1164]. Markers[181]. Market [1072, 1497, 1740].Marketing [338, 837]. Markov[666, 385, 144, 422, 1253, 1523, 1759, 918].Markovian [1602]. Markup [997].Martingales [386]. Maryland [1345].MAS [1284]. MASIVE [1480]. MASSAT[1488]. massive [1108]. Massively [1163].Match [378]. Matches [88]. Matching[82, 476, 91, 309, 850, 298, 95, 871, 93, 854,1274, 86, 80, 851, 596, 489, 472, 982, 81, 848,868, 812]. Material [1025]. Materials[1071]. Math [1026]. Mathematical[570, 780, 565, 1025, 1024, 1023, 774].Mathematics [1028, 1022, 806, 582].MathWeb [576, 774]. matic [776].Matrices [90]. Matrix[1681, 1685, 600, 893, 1722]. Matter [68].Maturity [331]. Maximal [88, 87].Maximize [1574]. Maximizing [644, 149].Maximum [1092, 853, 1240, 621, 710, 1674,1689, 873, 391, 695, 652]. Mazur [422].Mazurkiewicz [420]. McGill [273]. MDL[1644]. MDPs [1290]. Mean[1092, 1587, 1625, 1248]. Mean-Field [1587].Meaning [571]. Meanings [1394]. Means[1487, 887, 1153, 1413, 867, 1562]. Measure[1521, 912, 1672, 141]. Measurement

19

[1087, 889, 1649, 1085]. Measures[131, 1621]. Measuring[1269, 1765, 1458, 379]. Mechanical[1037, 738]. Mechanism[1168, 748, 907, 102, 1118, 1384].Mechanisms [1534, 1115, 1563]. Media[995, 1264, 1219, 1082, 991]. Median[917, 855, 845, 647]. Mediated [1278].Mediation [1298]. Mediator [1299].Medical [1506]. Meditation [40]. Meet[742]. MEGA [775]. Membership[1089, 613]. Memories [1577]. Memory[1139, 1171, 413, 1151, 623, 1612, 1177].Mental [1036, 1041]. Merchant [1479].Merge [641]. Merging [79, 140]. Merlin[598]. Mesh [1204]. Meshed [1251].Message [352, 1221]. Messages [372].Messaging [1289]. Meta[1680, 1226, 1386, 1430, 328, 1541, 794, 1357].Meta- [1226]. Meta-interpreter [1357].Meta-level [1541]. Meta-Model [328].Meta-parameters [1680]. Meta-reasoning[1386, 1430]. Meta-theoretic [794].Metacomputers [1165]. Metadata [1566].Metamodel [1536]. Meteo [717]. Method[179, 1633, 562, 507, 1744, 92, 1510, 987,1307, 1640, 121, 198, 1515, 893, 1195, 337,759, 42, 1646, 1719, 1274, 724, 236, 978, 977,1747, 335, 161, 1309]. Methodologies[465, 1518, 886]. Methodology [1349].Methods [1751, 1788, 1417, 745, 1203, 1188,844, 483, 676, 1205, 842, 345, 734, 992, 1622].Metric [1702, 855, 1303, 888]. Metrics[1349, 1126, 1730]. MGTP [1383].Microarray [1662]. Microcircuit [1610].Microcircuits [1609]. Microelectrical[1037]. Microprocessors [1168]. Microsoft[1020]. Microstep [1437]. Middle[252, 162, 251]. Middle-Size [251]. Middlet[1471]. Middleware[468, 802, 1151, 1542, 206]. Migratory[1711]. MIKE [195]. Milan [256]. Milling[1699]. MIMIZU [1032]. MIN [392].MIN-BISECTION [392]. MIN-CSP

[392]. Mind [1539]. MINHO [260].Minimal [600]. Minimalistic [1338].Minimax [1634]. Minimization[1784, 686, 646, 35]. Minimum [1207, 145,1409, 619, 1159, 1467, 89, 650, 1674].Mining [77, 1440, 813, 1449, 836, 1451,1151, 676, 1147, 1302, 345, 814, 1446, 1154,837, 1395, 1450, 1443, 1442, 335, 1673, 1448,1304, 1486, 1489]. Miro [206].Mismatching [13]. Mispredicted [1169].Missing [1648]. Mixability [134]. Mixed[1212, 1661, 1637]. Mixed-Signal [1637].Mixture [882, 1655, 1635, 1648, 884, 1653].Mixtures [862, 660, 151, 1693, 1760]. ML[920]. Mobile [1705, 185, 1241, 167, 544,1483, 1238, 1469, 1563, 1471, 1058, 1244,1564, 175, 1703, 7, 762, 217, 481, 1243].Mobility [1075]. Modal [439, 828, 450].Modalities [1014]. Mode [522]. Model[1165, 781, 1644, 782, 1624, 104, 1630, 1421,1783, 476, 300, 461, 328, 726, 395, 441, 859,1592, 1298, 930, 905, 1383, 1449, 374, 740,1096, 758, 1594, 1525, 1479, 1520, 1745, 1755,581, 1584, 1741, 21, 1098, 1099, 770, 443, 66,1197, 1734, 724, 326, 1570, 798, 32, 323, 624,14, 1287, 918, 1773, 869, 1546, 19, 35, 821,1667, 5, 1664, 1609, 807, 1560, 297, 1774,623, 1310, 1676]. Model-Based[859, 1298, 930, 905, 1525, 918].Model-Checking [395]. Model-Driven[323]. Modeling[931, 1124, 1726, 565, 466, 92, 563, 330, 328,1721, 1559, 674, 1299, 1585, 1693, 471, 1740].Modelling [870, 515, 1698, 384, 1466, 1097,920, 17, 884, 846]. Models[862, 882, 411, 1371, 1094, 908, 927, 783, 1298,1685, 1188, 684, 854, 1041, 207, 1523, 1501,1610, 437, 1301, 100, 1323, 1759, 873, 1389,213, 1290, 707, 1760, 846, 1766, 1653, 1268].Moderated [838]. Modern [117, 805, 954].Modification [1637]. Modified [884, 543].Modular [1204, 208, 1434, 111].Modularity [290]. Modularized [214].Module [968, 102, 1215]. Modules [102].

20

Molecular [341]. Moments [872].Momentum [1641]. Monitoring[1266, 1483]. Monoids [404]. Monolingual[1319, 1335, 1339, 1332, 1336]. Monotonic[1380, 1387, 1592]. Monotonicity [1500].Monuments [483]. Morphable [684].Morphological [1336, 873, 722].Morphologically [924]. Morphology[1706, 1599]. MorphoSys [1224]. Morton[1142]. Mosaics [859]. Most [596].Most-Specific-Rule [596]. Motion[239, 187, 202, 977, 1601]. Motor[971, 1052, 984]. Motor- [971]. Mount[967]. Mouse [595]. Move [84]. Movement[980, 213]. Movements [1604]. Moves [25].Movies [914, 489, 488]. Moving[491, 1414, 1774, 217, 463]. MP3D [1121].MPEG [1526, 914]. MPI [1126, 1192, 1164].MPI/OpenMP [1164]. Mpro [1340].Mpro-IR [1340]. MR [1502]. MS [1021].MSCs [395]. MST [1401]. MST-Based[1401]. MT [1345]. Multi[69, 1280, 186, 1282, 1687, 1283, 560, 1603,1354, 1122, 1677, 144, 1483, 1541, 282, 718,1455, 683, 169, 1537, 983, 1287, 920, 1288,1691, 1690, 1289, 914, 1700, 1404, 557, 1477,1533, 874, 762, 216, 1481, 1490].Multi-agent [1280, 186, 1282, 1283, 560,1541, 282, 1537, 1287, 1477, 1481, 1490].Multi-agents [1483]. Multi-armed [144].Multi-band [718]. Multi-categorical[1687]. Multi-Class [683, 1690].Multi-context [1288]. Multi-dimensional[1691]. Multi-drilling [1455].Multi-expert [914]. Multi-layer [1677].Multi-level [1404]. Multi-linear [920].Multi-lingual [983]. Multi-paradigm [69].Multi-periodic [1122]. Multi-platform[216]. Multi-sensor [169]. Multi-stage[1481]. Multi-step [1700]. Multi-stream[1603, 718]. Multi-threaded [1354].Multi-unit [1533]. Multi-valued [557].Multi-way [762]. Multiagent [48, 1371,188, 1534, 1488, 165, 1532, 1480, 1277].

Multicast [1211]. Multicasting [1207].Multiclass [1678, 710]. Multicolorings[640]. Multicontext [559].Multidimensional [383, 1301, 888].Multifrontal [1204]. Multilayer [1618].Multilevel [1500]. Multilingual[1316, 1333, 712, 725, 1348]. Multimedia[484, 970, 987, 1225, 1012, 965, 1224, 1013,1221, 1218]. Multimodal [1628, 1583, 488].Multiparty [1182]. Multipath [1249].Multiple [1376, 1572, 1576, 87, 903, 478,1776, 1772, 1261, 971, 1546, 1543, 1478, 45].Multiplication [528]. Multiplicative [132].Multiprocessor [1136]. Multiresolution[1762]. Multiscale [931]. Multiset [287].Multisets [793]. Multisignature [536].Multispectral [1150]. Multisubgraph[854]. Multithreaded [1189]. Multivariate[1517]. Multiversion [1155]. Multiwavelet[926]. Music[1061, 880, 1063, 1524, 1062, 1060].MuTACLP [1376]. Mutated [96].Mutation [800]. Mutual [623, 1539].

n [922, 1322, 1334]. N-Gram [1322].n-Tuple [922]. Name [1533]. Names [712].NanoJava [734]. Narrative [698]. NASA[1417]. Nash [351]. National [946]. Native[1011]. Natural[715, 466, 1757, 1678, 1572, 1574, 1466, 846].Navier [1203]. Navigating [405, 1023].Navigation[1647, 166, 196, 1015, 169, 492, 217].Navigational [1272, 1773, 1149]. Nazar[1229]. Near [141]. Near-Optimal [141].Nearest [916, 97]. Necessity [530]. Needs[1277, 954, 947]. Negation [815, 1361].Negations [829]. Negotiating [1535].Negotiation [1278]. Neighbor [1253].Neighborhoods [1727]. Neighbors [97].Neighbour [916]. Neighbours [916].Nested [85, 1139]. Net [802, 1720, 428].Nets [1095, 454, 314, 626, 864]. Network[1779, 1767, 1247, 1492, 1630, 1632, 1233,

21

1567, 1724, 423, 1590, 584, 1604, 1239, 1467,1777, 1292, 1594, 1210, 1208, 1520, 1745, 1542,710, 1645, 1584, 1099, 1251, 1706, 1591, 1588,1076, 1643, 391, 1236, 1267, 1774, 1452, 1701].Network-Hosted [1292]. Networking[1611, 1053]. Networks [1573, 493, 1743,1751, 1784, 1589, 1624, 1704, 1781, 371, 565,1241, 1616, 1775, 372, 1240, 1122, 915, 622,1678, 1206, 1721, 1216, 1629, 1765, 1762,1213, 1658, 1699, 1710, 1238, 1627, 1623,1600, 625, 1242, 1257, 1110, 1558, 1458, 1557,1244, 1737, 631, 1754, 602, 1575, 1660, 1696,1780, 1770, 1753, 649, 1787, 1636, 1602, 59].Neural[1779, 1767, 1634, 493, 1743, 1751, 1589, 1624,1768, 1492, 1630, 1632, 1616, 1775, 1724,1511, 1590, 1597, 1721, 1613, 1516, 1629,1617, 1762, 1658, 1699, 1777, 1627, 1695, 1623,1600, 1520, 1495, 1745, 710, 1584, 1458, 1706,1737, 1754, 1656, 1610, 1575, 626, 1660, 1696,1570, 1780, 1770, 1773, 1643, 1789, 1585, 1672,1736, 1774, 1753, 1571, 1787, 1636, 1723].Neural-Based [1656]. Neuro[1639, 1659, 1742]. Neuro-classification[1742]. Neuro-Fuzzy [1639, 1659].Neurodynamical [1569]. Neuron[1569, 1592, 1605]. Neuronal [1602].Neurone [1594]. Neurons[1603, 1587, 1588, 1713, 1580, 1763, 1771].News [672]. Next [752, 801, 1496].Next-Day [1496]. NFA [1734, 1494]. NFAs[98]. NGnet [1676]. NITStones2001 [231].NL [815]. NLDA [1678]. NMDA [1607].NN [1508, 1620, 501]. No [625, 1186].Noble [1250]. Node [1006]. Noise[718, 1575, 1753]. Noise-Robust [718].noising [1688]. Noisy [1441]. Non[890, 1091, 1133, 1108, 475, 1684, 563, 375,1387, 1134, 1135, 1592, 52, 561, 894, 1339,965, 62, 1746, 1182, 817, 37, 848, 453].Non-approximability [1133, 1134].Non-bayesian [848]. Non-binary [52].Non-commutative [563]. Non-dedicated[1135]. Non-deterministic [375, 62, 1182].

Non-disjoint [453]. Non-English [1339].Non-high [1108]. Non-iterative [894].Non-Japanese [965]. Non-linear[1684, 561, 37]. Non-literal [817].Non-massive [1108]. Non-monotonic[1387, 1592]. Non-parametric [890, 1746].Non-repudiation [1091]. Non-retrieval[475]. Nonconvex [127]. Nondeclarative[1358]. Nondeterministic [374].Nonholonomic [202]. Nonlinear[1726, 1641, 1719, 892, 1701, 1579].Nonmonotonic [439]. Nonstationary[671]. Normal [634]. Normalization [1329].Normalized [909]. Normative [1530].North [1066]. Notation [1063, 19]. Note[1165, 1237, 1200, 1124, 1125, 1145, 1155,1150, 1202, 1233, 1209, 1171, 1121, 1146, 1222,520, 1216, 1185, 1135, 1213, 1159, 1190, 1245,1210, 1183, 1208, 1195, 1131, 1244, 1141, 1175,283, 1119, 1158, 1118, 1224, 1215, 1221, 1229,1186, 1236, 1217, 1178, 1196, 1132, 1230, 1187,1163, 779, 1174, 1179, 1166, 1170, 1137, 1243].Noun [697, 1343]. Novel[562, 1592, 1698, 1223, 1019]. Novelty[1770]. NTCIR [1347]. Nuclear [1649].Nucleus [1601]. Nullstellensatz [358].Number [1133, 381, 619, 1487, 618, 644,370, 1162, 1692, 653, 1614, 652]. Numbers[702, 421, 620, 422, 601]. Numeracy [961].Numerical[1788, 1198, 1235, 1507, 564, 1433, 1446, 1166].Nuprl [73].

O [1189]. OAR [335]. Object[493, 872, 104, 181, 1761, 666, 1270, 1263,681, 70, 487, 842, 100, 667, 1780, 1714, 690,1703, 1149, 1196, 497, 1554]. Object-Based[487]. Object-Oriented [1270, 1263, 70].Objectively [110]. Objects[1354, 9, 1036, 1119, 34, 1414, 463].Oblivious [357, 376, 540]. Observable[1290]. Observation [156].Observation-Based [156]. Observational[196]. Observations [925]. Obstacle

22

[179, 175]. Obstacles [209, 217]. Obtaining[1183, 1662]. OCAWA [939]. Occam [638].Occurrence [698, 1321]. Occurrences [87].OCDMA [1268]. OCL [1424, 750]. OCL/RT [750]. OCR [878]. ODL [956]. Off [79].Off-Line [79]. Offering [967]. Office [1021].Offs [393, 350, 1089]. Older [934]. Omni[179, 209, 241, 175, 247]. Omni-directional[179, 209, 175]. Omni-directional/Pin-Hole [179]. Omnidirectional[199, 200, 163]. On-Line[1266, 633, 1639, 644, 645, 217]. One[94, 1663, 304, 404, 377, 521, 596, 1763, 662,1686]. One-Class [662]. One-Dimensional[596]. One-Gapped [94]. One-Probe [377].One-Rule [304]. One-Step [404].One-Time [521]. Online [963, 1006, 366,1641, 365, 505, 1739, 1008, 956]. Ontolingua[820]. Ontologies [464, 1282]. Ontology[818, 821, 45]. Ontology-Driven [45].Open [537, 758, 345, 1385, 1067]. Opening[1065]. OpenMP [1125, 1126]. Operating[1269, 1697]. Operation [537]. Operational[1535]. Operations [97, 84]. Operator[873]. Operators [298, 448]. OPM [465].Opponent [192, 213]. Opportunities[936, 941]. Optical [880, 1273]. Optimal[1130, 371, 122, 95, 1136, 1258, 151, 98, 855,1273, 1745, 1671, 1706, 1662, 624, 141, 428].Optimality [1144]. Optimally [85].Optimisation [1237, 442, 561]. Optimising[1192, 1197]. Optimization[1165, 686, 1234, 1235, 1378, 29, 53, 12, 1120,1402, 1657]. Optimizations [1208].Optimized [77, 350]. Optimizing[151, 988]. Optimum [1259]. Option[1751, 664]. Options [335, 36]. Oracular[42]. Orange [253]. Orchestra [107].Orchestrating [1106]. Order[1419, 434, 1705, 796, 135, 349, 550, 309,1756, 1095, 1383, 1418, 773, 308, 1356, 326,1384, 566, 1667, 867, 536]. Order-Specified[536]. Ordered [799, 1444, 138]. Ordering[782]. Orderings [790, 1359]. Orderly [602].

Organisational [1485, 1454]. Organising[1460, 1445, 1502, 1465]. Organization[331, 1729, 724]. Organizational [1536, 464].Organizations [1537]. Organizing [1726,1720, 1721, 1710, 1711, 1728, 485, 1727, 1718,1708, 501, 1709, 1730, 1715, 486, 1722, 1717].Orientation [181, 1772]. Oriented[820, 1270, 1263, 1542, 70, 1000, 938, 1196].Orthogonal [378, 383, 646, 611]. Osaka[267, 261]. Other [1080]. Out-of-Core[1411, 1097]. Outcome [1086, 1085].Outcomes [1087, 1083, 1084]. Outline[539]. Output [627, 713, 1643, 1670].Overcomplete [1738]. Overfitting [1441].Overhead [1125]. Overloaded [408].Overview [968, 1314, 1190, 1557, 339].Owaribito [242].

P [1220, 546, 626]. P-K [546]. P-Tree[1220]. PAC [40, 143, 144]. Pack’01 [269].Packages [961, 329]. Packaging [8].Packed [644]. Packet [1262, 596]. Packets[1611, 1758]. Packing [366, 645, 414].PACOSY [940]. PageRank [630]. Pages[1459, 460]. Paillier [543]. Pair [476].Pairing [697, 356]. Pairs [393, 87, 348].Pairwise [683]. PALIO [938]. Paper[227, 1203, 1239, 157]. Papers [708].Paradigm [802, 350, 580, 69]. Paradigms[381, 597]. Parallel[1130, 1200, 412, 1193, 1204, 146, 1202, 660,1199, 1222, 1167, 1235, 1123, 1203, 1188,1190, 93, 1227, 1147, 1117, 1153, 1162, 1148,1219, 1158, 1161, 1236, 721, 1149, 1196, 1132,1163, 1201, 1157, 1113, 1166, 1137].Parallelism [1143, 413, 1167, 1177, 1170].Parallelization [1138, 1151, 1141].Parameterized [654, 1254]. Parameters[1767, 10, 63, 1635, 129, 1654, 527, 1680].Parametric [187, 118, 606, 890, 1746].Parametrized [1714]. Paramodulation[799]. Parasite [1164, 1187]. Pareto[151, 1728, 29]. Pareto-Optimal [151].ParList [1158]. Parser [116]. Parsing

23

[1396, 846]. Part [823]. Partial[378, 1095, 346, 640, 66, 388, 1668].Partially [1063, 1453, 1290]. Participation[934]. Particle [1642]. Partition [872].Partitioning [1408, 107]. Partitions [449].Pass [541, 1763]. Passage [1334]. Passing[1221]. Passive [1554]. Patches [1659].Path [424, 790, 591, 1215, 1410, 348, 1236,132, 1211, 647]. Path-Based [1211]. Paths[393, 749, 363]. Pathways [1297]. Patient[940]. Pattern[77, 895, 675, 1521, 298, 83, 95, 1488, 883,574, 1595, 86, 116, 1596, 1774, 1509, 81].Pattern-Based [116]. Pattern-Terms[574]. Patterns[1440, 1608, 1750, 1451, 115, 1365, 138].Pause [698]. PC [1118, 1035]. PCA[865, 1688, 1653]. PCAs [1648, 1693]. PCs[1201]. PD [1072, 1070]. PDF [920, 924].PDMs [861]. Pedagogical [953].Pedagogically [954]. Pedestrian [679].Peeling [643]. Peer [1561, 1183].Peer-to-Peer [1561, 1183]. Peer2Peer[484]. Peircean [818]. PELCR [1194].Penalty [120]. APL [1329]. CC [788].Graphics [877]. HOL [1424]. IP [1208].Isar [1422]. Java [744]. Numeric [553].OpenMP [1164]. OR [621]. Pin-Hole[179]. Proper [697]. RT [750]. SVM [680].Termination [178]. Twine [1561].VHDL-Based [185]. WSI [615].Pennsylvania [279]. People[1016, 1030, 1045, 942, 1042, 1047, 1043,1015, 999, 940, 1010, 1005, 1040, 986, 981,1053, 977, 1034, 954, 1003, 1008, 934, 996,1070, 936, 959, 962, 941, 1001, 1009].Peptides [659]. Per-Item [398].Perception [1036, 1018]. Perceptions[509]. Perceptron [135]. Perceptrons[1633, 1677, 1618, 1662]. Percepts [39].Perceptually [875]. Perfect [361, 1161].Perfectly [547]. Performance[1232, 1124, 1212, 1108, 1127, 507, 1241, 1225,150, 1126, 1121, 383, 1109, 885, 751, 1138,

203, 1210, 1249, 1160, 43, 1120, 1154, 1261,1186, 1267, 1114, 922, 1113, 334, 1268, 1309].periodic [1122]. Periodicity [344].Permissive [825]. Permutation [622].Person [975, 488]. Personal[509, 1043, 1271, 1056, 1055, 1489].Personalisation [1445]. Personalization[1292, 837]. Personnes [1058]. Persons[939, 1063, 1020, 1007, 982, 1071, 1057, 976].Perspective [1283, 1367, 1486].Perspectives [1010]. Pervasive[1552, 1553, 1559, 1551]. Petri [1095].Philosophy [1346]. Phoneme [964].Phonetic [911]. Photographs [509].Phrase [1343]. Phrases [899, 697].Phylogeny [607]. Physical [1030, 981, 976].Physically [986]. Physiological [1571].Physiologically [1604]. Pictures [1036].Piecewise [1640, 920, 1643].Piecewise-Linear [1643]. PIM [1124].Pipelining [1205]. Piracy [546]. Place[1702]. Places [1040]. Plan [156, 338, 250].Plan-Based [250]. Planar [1408, 602].Planning[1370, 47, 166, 1382, 156, 50, 22, 437, 573].Plasmas [1649]. Plastic [1591]. Plasticity[1608, 1576, 1599]. Plate [681]. Platform[188, 1604, 1557, 1119, 1229, 1556, 321, 216].Platform-Based [321]. Platforms [339].Plausible [923]. Play [544, 973, 1470].Player [25]. Players [192, 221]. Playing[202]. PList [1158]. Pocket [958]. Point[862, 1707, 86, 508]. Point-Pattern [86].Pointers [1610]. Pointing [1032]. Points[778, 569, 874, 639]. Pointwise [588].Polarities [333]. Policies[1305, 151, 43, 946]. Policy [533]. Polish[702]. Polychotomic [122]. Polygon [635].Polynomial [423, 600, 610, 690, 138].Polynomial-Time [423]. Polynomially[358]. Polynomials [361]. Polytope [569].Poor [1735]. Population [1772, 1587, 1606].Pornographic [475]. Portable [1002, 1055].Portal [1044]. Portfolio [1499, 1733].

24

Portrait [1351, 1352]. Portugal [226].Portuguese [719, 711, 717, 705]. Pose[1714]. Position [90, 201, 1018]. Positions[98]. Positive [310, 138]. Possession [701].Possibilistic [1096]. Possibilities [1010].Post [1078, 1080]. Post-secondary[1078, 1080]. Potential [1642]. Potentials[1752]. pour [1058]. Power [1429, 350, 528,975, 612, 1610, 667, 1562, 833, 248].Power-Sum [612]. Powerdomain [379].PowerList [1158]. PowerPoint [1020].Practical [109, 952, 545, 1558, 97, 76, 165].Practice [764]. Pragmatic [822]. PRAM[1121, 1176]. Pre [1441]. Pre-pruning[1441]. Precision [1649]. Precomputation[1170]. Precondition [1438]. Predication[1223]. Predictable [8]. Predicting [659].Prediction [1232, 990, 152, 1735, 1699,1498, 1737, 983, 1739, 1497]. Predictions[141]. Predictive [1711, 986, 342, 884, 133].Predictors [1168]. Preemptive [408].Preferences [1055]. Preferred [1047].Prefetch [1171]. Prefetching[1406, 1253, 1169]. Prefrontal [1613].Prehension [1570]. Preparing [1033].Presentation [578]. Presentations[1020, 1221]. Presenting [1034].Preserving [293]. Prevention [519]. Price[1493, 1496]. Pricing [1751, 1493].Primality [511]. Primitive [543, 410].Principal [1708, 1716, 418]. Principled[1517, 58]. Principles [382, 387, 1537].Print [1061, 999, 1005, 1076, 1008, 996].Printed [857, 1524]. Printers [1033].Printing [1048]. Prior [1606, 141].Priority [356]. Privacy [461, 546].Proactive [1784]. Probabilistic[1091, 303, 1093, 1094, 927, 709, 655, 1095,1432, 1096, 1099, 1104, 379, 864, 1103, 213,174, 1693, 1673]. Probabilistically [250].Probabilities [1328]. Probability[1514, 1631, 1090, 867]. Probe [377].Problem [85, 1133, 1401, 633, 402, 145, 82,1555, 423, 1661, 1134, 1159, 1467, 1116, 604,

409, 538, 650, 607, 648, 1500, 1715, 1652,1236, 1114, 1385, 886]. Problems[41, 378, 660, 375, 614, 1658, 1378, 365, 363,855, 1655, 308, 345, 448, 568, 81, 37, 428].Procedure [466, 438, 792, 1385].Procedures [310, 364, 1387, 443, 765].Process [1743, 838, 1122, 316, 741, 1449,836, 1270, 1100, 938, 401, 760].Process-Oriented [938]. Processed [1045].Processes[385, 144, 1094, 67, 384, 339, 23, 738].Processing [1130, 182, 968, 815, 1122, 704,1293, 398, 720, 1750, 1296, 1010, 1466, 1455,1672, 1187, 725, 1464]. Processor[1163, 462]. Processors [1247, 1173].Produced [1045]. Producing [1051, 1042].Product [319, 331, 325, 329, 330, 316, 317,333, 338, 337, 326, 323, 336, 1472, 327, 332,335, 324, 320, 321, 322]. Production[318, 864]. Products [1469]. Professionals[1026]. Profiles [1649]. Profiling [69].Prognosis [840]. Program [72, 73, 787, 67,1363, 346, 981, 1362, 1442, 788, 756].Programmable [1146]. Programmes [994].Programming[1370, 1390, 222, 112, 191, 9, 1355, 65, 1366,1367, 580, 927, 1431, 1681, 1360, 1188, 588,1353, 1164, 1197, 24, 1368, 646, 64, 1176,1395, 111, 1090, 1365, 552, 1369].Programming-Based [1360]. Programs[369, 616, 4, 1192, 1407, 554, 62, 1113, 1438].Progression [866]. Progressive [1186].Project[838, 458, 713, 1056, 1179, 949, 1044].Projection [882, 307, 1603, 1677, 1516, 908,1719, 1674, 224, 868]. Projects [935].Prolog [449, 1391, 1365]. Promise [1110].Promote [963, 167, 1030]. Proof[802, 432, 803, 434, 766, 1101, 1382, 65, 1429,1387, 771, 441, 454, 770, 1433, 573, 1384,578, 767, 729, 1385, 775, 795, 1533, 756].Proof-Carrying [766, 767]. Proof-Net[802]. Proof-Search [770]. Proof-Verifier[1384]. Proofs [74, 362]. Propagation

25

[1165, 1765, 1252]. Proper [146, 712].Properties [1582, 1358, 599, 312, 759, 294].Property [757, 514, 293]. Proposal[989, 1424, 977]. Propositional[1381, 438, 771, 446, 38]. Propositions[780]. Prosody [1025]. Prospects [1363].Protecting [546]. Protection [535].Protocol [1091, 622, 1216, 1245, 1099, 1244,287, 1289, 19, 992, 1533]. Protocol-Based[19]. Protocols [1370, 1241, 65, 352].Prototype [1121, 896, 1054, 119].Prototype-Based [119]. Prototypes [467].Prototyping [1122]. Provably [416].Prover [1383, 450]. Provided [1169].Providers [1546]. Providing[1015, 1078, 1082]. Proving[1419, 796, 1428, 1433, 798, 1437, 576].Provision [1080, 1054, 1076]. Proxy [1269].Pruning [1704, 1441]. Pseudo [1274, 1324].Pseudo-bipartite [1274].Pseudo-Relevance [1324]. PSPACE [401].PSPACE-Hard [401]. PTAS [403]. Public[943, 1553, 515, 612, 543]. Public-Key[612, 543]. Pulsed [1777]. Puncturing[1690]. Pure [1357]. Purpose [1137]. Purse[744]. Pursuit[417, 882, 183, 1603, 1516, 1498, 1674].Pursuit-Evasion [417, 183]. Pushdown[400]. Pushpin [1557]. Putting [1552].PuzzleTool [1431].

QoS [1254, 15]. QoS-Aware [15]. QR[1199, 1664]. QR-cp [1664]. Quadratic[511, 1590]. Quadruped[196, 199, 1696, 170, 212]. Quadrupedal[187]. Quality [1306, 1735, 1765, 1252].Quantified [435, 443, 772, 569, 450].Quantifier [552]. Quantifying [1528].Quantization [1778, 1628, 1711]. Quantum[369, 1514, 655, 657, 656]. Quasi [122].Quasi-Optimal [122]. Queries[459, 1316, 458, 1333, 591, 1450, 1456].Query [1331, 1311, 378, 479, 904, 1294,1293, 1296, 1148, 31, 1327, 1326, 1315, 142].

Query-Translation [1315]. Querying[390, 1310]. Quest [367, 789]. Question[449]. Queues [356]. Quick [1009]. Quickly[1051]. Quotient [1434].

R [1385]. Radar [1754]. Rademacher [130].Radial [1624, 1621, 1701, 1668]. Radio[371, 372, 622, 625, 1242, 631]. Railway[740, 1404]. Random [421, 666, 382, 618,1098, 1587, 128, 851, 1326, 867].Randomized [417, 631]. Randomizing[361]. Randomly [494, 853]. Range[1447, 378, 383]. Range-Encoded [1447].Rank [1199]. Rank-Revealing [1199].Ranking [624, 504]. Rapid [1641]. Rat[674]. Rate [1598, 1669, 1592, 1605]. Rates[1752]. Ratio [1136, 1405]. Rational [172].Ray [1161]. Razor [638]. RBF [1685, 1664].RDF [819, 116]. Re [514]. Re-keying [514].Reachability [349, 653]. Reactive [1530].Reactivity [1189]. Read [735]. Reader[1024, 1046]. Reading[972, 1007, 1013, 1539]. Real[381, 1552, 1102, 1107, 422, 679, 1531, 211,1176, 348, 601, 886, 1304]. Real-Number[381]. Real-Time[1102, 1107, 679, 1531, 211].Real-Weighted [348]. Real-World [886].Realistic [1107]. Reality [960, 1040, 959].Realizability [395]. Realization [964].Realizers [429]. Realizing [1172]. Reason[433]. Reasoning[114, 782, 1376, 1420, 50, 1387, 439, 567, 586,764, 444, 1361, 794, 575, 840, 774, 1386, 1430].Receptive [1574]. Receptor [1607].Recogniser [1062]. Recognising[856, 1669]. Recognition[862, 562, 895, 1639, 675, 898, 666, 706, 680,915, 870, 906, 1750, 1627, 684, 907, 883, 897,909, 1523, 564, 842, 864, 667, 368, 869, 1714,690, 1763, 672, 1774, 1518, 922, 910, 1622,707, 1463, 497, 858, 1766, 877].Recognizability [293]. Recognizing [213].Recommendation [1472].

26

Recommending [938]. Recompilation[736]. Reconfigurable [1190, 1224, 1179].Reconfiguration [6, 5]. Reconstruction[344, 1758]. Record [1506]. Records [1436].Recovery [514, 512]. Recurrence [1145].Recurrent [1781, 1617, 1660, 1789, 1753,1787, 1701, 1602]. Recursive [459, 790, 421,1616, 73, 1522, 905, 896, 410, 305, 1438].Reddogs [273]. Reduce [1441]. Reduced[541]. Reducing [120, 1589, 845].Reduction [1093, 1192, 290, 896, 894, 1664].Reductions [374]. Redundancy [1174].Reed [360]. Reengineering [330, 335].References [705]. Refined [1307].Refinement[755, 1093, 1094, 33, 747, 754, 593].Reflection [100, 794]. Reflex [1585].Reformulating [53]. Reformulation[41, 49, 52, 22, 59]. Refutations [358].Region [175, 1774, 473, 1016]. Regions[875, 478]. Register [1173]. Regression[1644, 1680, 1640, 1685, 1655, 1691, 1497].Regular[354, 620, 618, 847, 859, 98, 66, 591, 295, 1157].Regularise [927]. Regularity [1468, 401].Regulatory [1332]. Rehabilitation[1065, 979, 1052]. Reinforcement[1491, 1519, 210, 35, 1694, 1700, 36]. Reject[664]. Related [378, 1308, 1413]. Relation[808]. Relational [726, 810, 588, 742, 682].Relations [583, 1702, 211, 808, 38].Relationship [478]. Relationship-Based[478]. Relative [416]. Relaxation[24, 1638]. Relevance[1644, 1727, 1324, 1528]. Relevant[708, 954]. Remarks [718]. REMathEx[1024]. Remote[1266, 1068, 966, 1054, 1186, 164].Remote-Write [1186]. Removable [365].Rendering [1107, 1000]. Repeats [96].Repertoire [1582]. Repetition [629].Replacement [9, 685]. Replenishment[696]. Replication [16]. Report [1315].Reports [714]. Repository [1295, 1565].

Representation[288, 1761, 1514, 1619, 1687, 1616, 820, 1036,299, 811, 892, 807, 1764, 527].Representations[1572, 588, 897, 1100, 817, 1614].Represented [783]. Representing[1391, 317, 808]. repudiation [1091].Request [1255]. Requests [1149].Requirements [570, 467, 1043, 252, 517].Requires [386]. Requiring [1227].Rerouting [1257]. Resampling [1633].Rescue [207, 160, 283, 171, 284, 281, 165].Research[1165, 1237, 1200, 1124, 1125, 1145, 1155,1150, 188, 1202, 509, 1233, 167, 1209, 1171,1121, 1146, 1222, 1216, 1185, 51, 1135, 1213,718, 1159, 1190, 1245, 1210, 1183, 1208, 1195,1131, 1244, 1141, 1175, 1119, 1158, 1118, 1224,1215, 57, 1221, 1229, 1186, 1236, 539, 1217,1178, 1008, 1385, 1196, 1132, 1230, 1187, 1163,1556, 1174, 1179, 1166, 935, 1170, 1137, 1243].Residential [1260]. Residual [289]. Resist[528]. Resolution [777, 432, 803, 182, 438,359, 1245, 693, 1588, 700, 705, 1764].Resolving [532]. Resonance [1505, 1588].RESORT [1054]. Resource [739, 1561,1381, 366, 1185, 1239, 3, 1443, 1477, 2, 1172].Resource-Constrained [2].Resource-Flow [1172]. Resources[1286, 1318, 1081, 1329, 1008]. Respina[227]. Response [1592, 1227]. Restoration[1767, 1762, 905]. Restricted [1626].Restrictions [1321]. Results[1133, 155, 1314, 347, 426, 1005, 581, 406,648, 34, 396, 935]. Retinal [1597].Retraining [1780]. Retrieval[493, 498, 495, 507, 1320, 1150, 494, 805,1316, 491, 479, 482, 1335, 1729, 904, 860, 871,483, 500, 1317, 478, 1274, 487, 470, 1321,1334, 1339, 1336, 474, 503, 504, 502, 496,486, 1673, 497, 1346, 473, 481, 1309, 475].Retrieve [1526]. Retrieving [1462].Retroactive [1784]. Returns [416]. Reuse[1140, 1139]. Revealing [1199]. Reverse

27

[1249]. Reverse-Link [1249]. Reversible[655, 355]. Review [843, 727, 954].Revision [825]. Revisited[180, 439, 657, 289, 734, 1527]. Revocable[546]. Rewrite [303, 295, 305, 296].Rewriter [311]. Rewriting [302, 300, 312,291, 304, 404, 306, 289, 287, 293]. RFID[1554]. Rhetorical [708]. Rhythms[1595, 1596]. Rich [1582, 997, 1544]. Ridge[1654]. Rights [1280]. Rings [407, 632].Risk [1155, 1760]. Risk-Free [1155]. RK[1205]. RMIT [284]. RMIT-on-Fire [284].Robo [173]. RoboBase [164]. RoboCup[155, 159, 207, 281, 262, 184, 243, 188, 156,279, 252, 162, 204, 283, 256, 246, 284].RoboCup-2001 [155]. RoboCup-Rescue[207, 281]. RoboCuppers [250].RobocupRescue [282]. RoboLog [229].RoboMutts [274]. RoboRoos [248].ROBOSIX [262, 243]. RoboSoccer [253].Robot [185, 166, 167, 159, 191, 194, 196,1695, 202, 280, 163, 267, 170, 266, 251, 260,214, 217, 269, 216, 481, 248]. Robotic [210].Robotics [206]. Robots[1704, 1705, 258, 239, 190, 197, 199, 162,1558, 169, 212, 174, 175, 1703]. Robust[1743, 186, 1684, 1724, 1756, 718, 929, 865,1274, 1747, 1746, 472, 1688, 269].Robustness [1429, 1253]. Rogi [244]. Role[698, 1389, 677, 1614]. Rolling [230].Roobots [245]. Rosser [353]. Rotation[1374]. Rotations [95]. Rough [1521].Round [361]. Routed [1211]. Routing[1212, 41, 371, 1241, 1209, 622, 1206, 351,1617, 1213, 1250, 1251, 1259, 602]. Rovers[270]. RSA [511, 520]. RSTIndex [1462].Rule [304, 1710, 596, 1452, 1506, 1304].Rule-Based [1506]. Rules[1632, 835, 1307, 836, 1444, 1435, 1362, 1443].Running [193]. Runs [1338]. Runtime[1171]. Russian [1333].

s [968, 785]. S.P.Q.R [263, 275]. Sacrifice[1186]. Safe [121, 61, 119]. Safeness [736].

Safety [1272, 759]. SAHARA [1546].Salesman [1715]. Saliency [1697, 473].Salient [508]. Sample [893]. Samples[895, 1662]. Sampling[382, 1635, 1736, 1157]. SAT[780, 651, 599, 1488]. Satellite [1150].Satisfaction [375, 614, 53, 566].Satisfiability [778, 1403, 568, 789].Satisfying [651]. SB [1121]. SB-PRAM[1121]. SBCe [219]. Scalability[1283, 1225, 1115, 1152]. Scalable[1561, 1233, 1567, 767, 1196, 1673]. Scalar[528]. Scale [1220, 874]. SCALEA [1113].Scaling [660, 810, 1525, 1789, 888].Scaling-Up [1525]. Scan [1193, 1567].Scenarii [564]. Scenario [12].Scenario-Based [12]. Scenarios[467, 1541]. Scene [489, 692]. Scenes [688].Sceptical [1387]. Schedule [529, 1564].Scheduler [1189, 1132]. Scheduler-Centric[1189]. Scheduling [1130, 41, 408, 364, 1128,1613, 1134, 1136, 567, 1131, 406, 1129, 1148,1219, 1154, 1194, 1543, 1374, 1144]. Schema[1295, 1297, 813, 1461, 1435]. Schemas[708]. Scheme [686, 1613, 1173, 538, 514,1223, 1267, 477, 523, 536]. Schemes[516, 73, 423, 896, 517, 530]. Schmitt [1695].School [1552, 947]. Schutte [434].Schutte-Tait [434]. Science[1026, 1398, 806, 582]. Sciences [1027].Scientific [708, 1010, 1230]. Scientist[1351]. Scope [336]. Scopes [113]. Scoping[337]. Score [90, 1684, 1329, 1062]. Scores[1524]. Screen [1046]. Script [878]. SDL[758]. SDL-Systems [758]. Seagoing[1272]. Seamless [413]. Search[781, 47, 364, 383, 771, 1378, 860, 27, 1488,770, 1162, 1593, 24, 1403, 501, 377, 1527, 812].Searches [1114]. Searching [378].SearchServer [1337]. Second[1705, 135, 1756, 1347, 308, 867, 451].Second-Order [1705, 135, 308, 867].secondary [1078, 1080]. Secret[520, 517, 519]. Section [1065]. Secure

28

[1004, 361, 547, 514, 1090, 535, 536].Security [1370, 1091, 65, 287, 541, 1186,543, 530, 531, 512]. See [967]. See-through[967]. Segmentation[881, 911, 1777, 170, 1780, 1580]. Segments[96, 639]. Select [458]. Select-Project[458]. Selected [1108]. Selecting[373, 1654, 1636]. Selection[890, 1644, 1508, 1140, 1783, 302, 732, 1510,1415, 1680, 403, 201, 1273, 30, 1253, 1718,1343, 889, 1667, 1657, 250, 891, 1509, 1670,695, 178, 1676]. Selective [964]. Self[124, 180, 1726, 1704, 1720, 1181, 1721, 1460,1710, 1445, 1711, 1728, 485, 151, 205, 628,1727, 1718, 1197, 1708, 724, 1175, 501, 1709,1730, 1715, 1414, 1502, 486, 1465, 175, 988,1722, 1717]. Self-Adjusting [1414].Self-Assembling [628]. Self-indexed[1175]. Self-Localisation [180].Self-Localization [205, 175].Self-optimising [1197]. Self-Optimizing[151, 988]. Self-Organising[1460, 1445, 1502, 1465]. Self-Organization[724]. Self-Organizing [1726, 1720, 1721,1710, 1711, 1728, 485, 1727, 1718, 1708, 501,1709, 1730, 1715, 486, 1722, 1717].Self-stabilizing [1181]. Self-Typed [124].Selfish [351]. Sellers [1538]. SEM [779].Semantic [498, 464, 346, 499, 1458, 100, 700,1326, 1310, 1463, 451, 812, 761].Semantically [997]. Semantics[1423, 1424, 1459, 703, 1285, 818, 1535, 343,1437, 123, 473, 452, 38]. Semantics-Based[123, 473]. SemCor [1328]. Semi[1661, 1136, 362, 1461, 56, 601, 1457].Semi-algebraic [362]. Semi-computable[601]. Semi-dynamic [1136]. Semi-Lattice[56]. Semi-structured [1461, 1457].Semi-supervised [1661]. Semiconcept[832]. Semidefinite [1681]. Semigroups[559]. SEN [952]. Sensation [1018]. Sense[101, 1018, 695]. Sensibility [1632].Sensing [186, 168]. Sensitive[790, 82, 1675, 1594, 306, 678, 1402, 938].

Sensitivity [1598]. Sensor[1110, 1558, 1706, 1557, 1056, 170, 169].Sensors [182, 217, 1562]. Sensory[968, 674, 977, 1583]. Sentence [816].Separability [1666]. Separate [125].Separation [1756, 322]. Sequence[835, 680, 1451, 574, 97, 606]. Sequencer[1184]. Sequences [85, 1582, 1139, 1572, 373,1780, 913, 1753, 1666, 1602]. Sequencing[1725]. Sequent [445, 433, 1435, 557].Sequential [1784, 1440, 843, 1655, 23, 918].Series [1743, 671, 192]. Server[460, 1255, 1260]. Servers [1233, 1264, 1219].Service [1266, 1087, 1004, 1258, 1264, 1080,1262, 1272, 18, 1054, 1260, 1076, 1546, 1565].Services[1231, 942, 1292, 1000, 1758, 110, 1001].Session [959]. Set [421, 796, 898, 307, 1225,627, 778, 414, 1384, 64]. Sets[67, 896, 1153, 1303, 295, 81]. Setting [531].Several [183]. Severe [968, 1030, 981].Shading [901, 863]. Shallow [1336]. Shape[862, 666, 487, 901, 863, 472, 861].Shape-from-Shading [901, 863]. Shared[511, 1192, 1151, 623]. Sharif [246]. Sharing[310, 518, 484, 106, 517, 519, 1178].Sharpening [638]. Sheffield [1344].Sherlock [544]. Shift [1502]. Shifting [904].Shifts [1623]. Ship [1259]. Shock [852].Short [1102, 283, 1073, 521, 535, 1540].Shortest [393, 1410, 348]. Shostak[791, 286]. Should [997]. Side[1379, 734, 542]. Sighted [1063]. Sign[966, 965]. Signal [968, 1637, 1732, 927, 659].Signaling [698, 1254]. Signalling [740].Signals [1724, 1522, 1711]. Signatures[521, 534]. Signing [521]. Signs [115]. SILC[1056]. Silhouettes [842]. Silicon [668].SIMD [1223]. Similar [616, 1603, 1574].Similarities [1503]. Similarity[507, 1440, 1521, 1458, 724, 86]. Simple[120, 184, 109, 528, 1574, 1755, 809, 97, 1073,569, 623, 1579]. Simplicity [141].Simplified [438]. Simply [1399]. Simpson

29

[748]. Simulate [587, 358]. Simulated[1633, 201, 1725]. Simulation[1124, 968, 156, 755, 1455, 1164, 160, 283,284, 165, 1532, 234]. Simulations [1202].Simulator [219, 281]. SINAI [1328]. Single[1752, 622, 1569, 985, 1732, 1721, 645, 1755].Single-Hop [622]. Single-Neuron [1569].Single-Trial [1755]. SIP [1127]. Site[939, 1622, 1029]. Sites [943]. Situation[468, 1723]. Situational [990]. Situations[250]. Size [516, 494, 189, 372, 252, 162, 625,1635, 246, 251, 68, 248]. Sized [644, 366].Skeleton [1193, 1191]. Skeletons[1237, 1232]. Skills [1059, 950, 1076]. Skin[1520]. Skin-Color [1520]. Sleep [1732].Sliced [1447]. Slices [1135]. Slot [748].Slovakia [1028]. Slow [1582]. Small[1573, 609, 189, 246, 1593, 170, 367, 1562, 248].Small-World [1573, 1593]. SMO [685].Smooth [187, 1643]. Smoothed [1709].SMP [1152]. SNePSwD [825]. Snooker[490]. SOAP [1265]. SOAP-Based [1265].SoapBox [1556]. Soccer [166, 190, 279, 191,201, 202, 169, 210, 173, 174, 176, 214, 216].Social [963, 955]. Societies [1282]. Society[955, 942, 934, 936]. Software [467, 331, 325,1171, 757, 317, 318, 18, 1364, 1058, 339,1197, 1, 3, 823, 1064, 76, 965, 336, 954, 1652,1178, 1560, 332, 2, 1538, 7, 320, 576, 774].Solomon [360]. Solution [1097, 1163, 1166].Solutions [26, 37]. Solve [699, 1652].Solver [1715]. Solvers [789]. Solving [85,570, 780, 1200, 402, 796, 614, 1116, 591, 772].SOM [1729]. Some [895, 131, 1381, 1341,581, 1392, 971, 34, 295, 451]. Somesthetic[1018]. SOMs [1714]. Sony [159, 197, 280].Sort [1415]. Sorting [356, 641]. Sound[746]. Source [1127, 1241, 329, 1756].Source-Level [329]. Sources[1202, 1474, 1310]. Space[104, 375, 88, 363, 855, 637, 1737, 24, 170, 926].Space- [104]. Space-Economical [88].Spaces [1654]. Spanish [711, 1335, 699].Spanning [1409, 370, 1159, 602]. Sparrows

[265]. Sparse [1200, 1679, 674, 348, 1682].Sparsifying [1685]. Spatial[390, 478, 892, 1583]. Spatio [211, 1570].Spatio-temporal [211]. Spatiotemporal[23]. Speaker [912]. Speaking [1025].Special [950, 954, 947, 959]. Specialization[1482]. Species [913]. Specific[90, 1360, 575, 596]. Specification[1102, 744, 1146, 1360, 388, 1288].Specifications[781, 1420, 732, 584, 346, 587]. Specified[536]. Specifying [464, 172]. Spectra[1505, 1502]. Spectral [849, 842, 1746].Spectrally [480]. Speech[968, 706, 713, 911, 1763, 672, 707]. Speed[978, 141, 175]. Speeding [1175, 1700, 1149].Speeding-up [1700]. Spike[1608, 1713, 1607]. Spike-Driven [1608].Spike-Timing [1713]. Spiking [1587, 1763].Spin [493, 666]. Splice [1622]. Splitting[1322, 80]. Spoken [876, 1061, 994].Spontaneous [1575]. Sports [903].Spotting [964]. SQL [1450]. Squares[1679]. Squid [1269]. SSA [1664]. Stability[1203, 1646, 1667]. Stability-Based [1667].Stabilized [1571]. Stabilizing [1209, 1181].Stable [1371, 778, 1641]. Stackelberg [406].Stage [1639, 1481]. Staging [1732]. STaMs[1284]. Standard [1072, 948, 173]. Star[354, 1414]. STAR-Tree [1414]. Start[1114]. State [1788, 706, 67, 395, 198, 1737,24, 174, 1565, 44]. Statecharts [172].States [1084]. Static [744, 362, 290, 61].Station [1483]. Statistical [1031, 642, 870,906, 1323, 722, 1103, 96, 1397, 1486, 142].Statistics [402, 1756, 1602]. Status [1036].Stave [1524]. Stealing [1227]. Steiner[1401, 607]. Stemming [1335, 1337]. Step[404, 823, 978, 954, 1700]. Stepwise [1208].Stereo [179, 1697, 927, 209]. Stimuli [1602].Stochastic [369, 1102, 1669, 1698, 1100,1097, 1164, 23, 373, 1593, 1588, 212, 1786].Stock [1493, 1497]. Stokes [1203]. Stooges[237]. Stopper [80]. Storage

30

[1577, 1228, 1405]. Story [1540]. Strategies[416, 1325, 303, 302, 1093, 1277, 406, 24,1362, 295, 1008, 1481]. Strategy[400, 943, 1258, 1255, 226, 147, 311, 1114, 177].Stream [1122, 1264, 522, 524, 1603, 718].Stream-Processing [1122]. Streaming[1258]. Streams [399, 398]. Strengthening[529]. Stricter [386]. String[402, 82, 304, 93, 89, 80, 851, 403]. Strings[83, 87, 845]. Strong [1385, 401, 530].Strongly [460, 1571, 425]. Structural[856, 870, 852]. Structurally [879].Structure[1615, 757, 351, 698, 630, 808, 1442].Structured [933, 138, 1456, 1461, 1457].Structures [371, 357, 805, 383, 515, 1011,1436, 596, 1666, 1463, 1486]. Students[1026, 1024, 1078, 1080, 1028, 1081, 1000,967, 1076, 1022, 1075, 1027]. Studies [1370].Studio [1064]. Study[1549, 739, 1241, 732, 167, 1409, 643, 1406,1468, 590, 317, 1262, 1494, 953, 116, 794,1082, 1609, 690, 1084, 1480, 1174, 1268].Studying [1075]. Style [434, 1428, 441, 773].Sub [1016, 403]. Sub-region [1016].Subcubic [603]. Subgraph [853]. Subject[1456]. Subjectively [507].SUBSEQUENCE [85]. Subsequences[373]. Subset [378]. Subsets [921].Substitution [298]. Substitutions [409].Subtitled [994]. Subtitles [994].Subtraction [542]. Subtyping [118].Successful [321]. Successive [868].Sufficient [799]. Suffix [637]. Suffixes [89].Suite [733]. Sum [612]. Summaries [506].Summarization [505]. Summarize [708].Summary [51, 57]. Superexponential[304]. Superlogarithmic [424].Superposition [441]. Supertrees [636].Supervised [895, 1669, 1662, 1503, 1661].Supervision [194]. Supplementing [760].Support [960, 1785, 1549, 1281, 464, 1687,1112, 675, 1679, 671, 1680, 1476, 664, 668,1762, 1449, 679, 689, 1776, 678, 3, 1692, 659,

1690, 1747, 1746, 682, 672, 1075, 1509, 677,670, 687, 1497, 1152]. Supported [1685].Supporting [108, 164]. Supports [1269].Surface [428]. Surfaces [1427, 901, 634].Surfing [461]. Surveillance [1770]. Survey[1016, 675, 1330, 1386, 709, 1293, 1368, 1389,1046]. Survivable [423]. Survival [1247].SVD [1664]. SVM[686, 663, 1685, 684, 683, 667, 1758, 690].Swarm [222, 1482, 1484]. Sweden [277].Sweep [759, 1412]. Sweep-Line [759].Sweeping [376]. Symbol [870]. Symbolic[69, 400, 553, 300, 1123, 27, 555, 561, 1100,564, 626, 577, 557]. Symbolic/Numeric[553]. Symbols [574]. Symmetric [363].Symmetry [782, 1581, 779]. Synapse[1704, 1576]. Synaptic [1608, 1587].Synchronization [1216, 1118, 762].Synchronized [313]. Synchronous[1134, 1249, 1575]. Syntactic [800].Syntactical [722]. Syntax [1419, 703, 343].Synthesis[752, 400, 1146, 1363, 394, 554, 788].Synthesizing [753]. System[179, 1232, 1266, 1269, 185, 1639, 1320, 188,717, 987, 1087, 1012, 1298, 1048, 555, 940,1473, 200, 979, 776, 162, 1469, 1347, 975,1249, 1032, 1272, 1131, 1164, 986, 1251, 1271,1471, 878, 1557, 339, 1334, 1504, 699, 1056,163, 966, 1223, 1054, 1034, 1402, 1773, 1747,486, 721, 1543, 786, 293, 557, 1149, 692, 1673,455, 165, 1052, 1701, 1067, 216, 788, 15, 481,1457, 512, 1490, 774]. System-on-Chip[1223]. Systematic [1190, 324]. Systems[1280, 1549, 1184, 1726, 1145, 571, 1619, 507,989, 186, 1358, 1102, 112, 1283, 560, 6, 408,1122, 915, 312, 1277, 1037, 1642, 113, 937,1641, 1190, 1559, 394, 1698, 358, 758, 1273,1097, 1104, 70, 1265, 1482, 1244, 626, 1328,1180, 433, 446, 1228, 1287, 55, 747, 1288, 948,17, 1289, 944, 1182, 1089, 1404, 396, 707,305, 1571, 1480, 531, 1152]. Systolic [612].

t [968]. t/ [968]. T3 [1448]. Tableau

31

[436, 440, 442, 446, 453]. Tableau-Based[436]. Tableaux [435, 441, 451]. Tables[602]. Tabulation [1397]. Tactical [1419].Tactile [1033, 1038, 1037, 1032]. Tagged[1172]. Tags [1554]. Tait [434]. Take[955, 935]. Taking [703, 1079]. Talk [1090].Talkie [195]. Talking [1042, 933]. Tangent[897]. Target [915, 1175]. Task[1134, 709, 1129, 1339, 283]. Task-Graphs[1129]. Tasks[166, 439, 1333, 1544, 1154, 1773].Taxonomy [1306]. TCM [1261]. TCP[1267]. Teach [948]. Teachers [951].Teaching [188, 987, 1059, 826, 956]. Team[268, 278, 230, 276, 227, 262, 235, 256, 243,233, 223, 189, 279, 238, 231, 242, 270, 225,271, 263, 157, 255, 226, 280, 259, 246, 267, 236,232, 275, 219, 266, 284, 251, 173, 260, 244, 277,247, 253, 254, 218, 177, 269, 264, 228, 159].Teamwork [252, 226]. Technical[1025, 971, 1034]. Technique[120, 1249, 578, 62, 1736]. Techniques[1331, 856, 183, 48, 51, 1135, 1658, 860, 1138,1322, 866, 1496, 345, 1462, 1586, 743, 1327,508, 37]. Technologies[942, 1043, 954, 1111, 936]. Technology[468, 1016, 1065, 1087, 951, 1086, 1078, 1053,944, 1082, 1083, 1084, 1079, 946, 976].Technology-Based [1078]. TeDUB [1034].Tele [1054]. Tele-Help [1054]. Telephone[717]. Telephone-Based [717]. Temporal[419, 1376, 711, 766, 438, 300, 1286, 420,1750, 1574, 1444, 29, 1117, 699, 1570, 1753,1599, 861, 1602, 830, 59, 211]. Temporally[1155, 1444, 44]. Term [312, 1615, 971, 722,1739, 293, 1503, 305, 1345]. Term-for-Term[1345]. Termination [1307, 1432, 306, 1361].Terms [872, 1341, 574, 299]. Terrain [635].Tertiary [1228]. Test [511, 733, 732, 476,1338, 1729, 743, 884, 165, 1029]. Test-Bed[165]. Testability [1263]. Testbed[560, 176]. Testing[385, 109, 778, 427, 730, 724, 1103]. Tests[1263]. Texels [859]. Texprint [879]. Text

[1050, 77, 990, 137, 813, 709, 710, 983, 814,692, 1673, 877, 1489]. Text-to-Scene [692].Text/Graphics [877]. Texts[720, 1010, 699, 705]. Textual[1025, 1544, 1011]. Texture[930, 681, 902, 1163, 926]. Texture-Based[681]. Textures [879]. TFA [1733, 1493].Thai [1330]. Their [1697, 51, 478].Thematic [959]. Theorem[556, 1419, 1422, 429, 1749, 796, 787, 1427,1428, 1383, 1433, 798, 794, 450, 451, 576].Theoretic [1423, 30, 794]. Theories[124, 310, 1376, 1158, 34, 286, 453]. Theory[1101, 145, 1616, 509, 73, 1493, 349, 1569, 65,1597, 904, 764, 581, 404, 342, 1156, 573, 289,236, 1384, 447, 341, 649, 1771, 1279].Theory-Based [1493]. Thin [120]. Think[992]. Thomson [1332]. threaded [1354].Threatening [840]. Three[633, 495, 91, 1494]. Threshold[516, 517, 136]. throughout [999]. Tickets[623]. Tiered [205]. Tiled [1253]. Tiling[1139]. Time[419, 85, 1743, 104, 1102, 402, 1107, 671, 423,438, 192, 74, 1135, 1258, 679, 1098, 637,1531, 1244, 1737, 437, 211, 624, 1228, 1402,391, 521, 1789, 138, 425, 1172, 1248].Time-Based [1244]. Time-Efficient [104].Time-Scaling [1789]. Time-Sensitive[1402]. Time-Tagged [1172]. Timed[1184, 384]. Timeouts [586]. Times [1214].Timetable [1404]. Timing[749, 33, 1713, 1090]. Tissue [626]. TL [974].TNO [1318]. Token [1181]. Token-Based[1181]. Tolerance [1231, 567]. Tolerant[1184, 1372, 1251, 641, 1089]. Tolerating[547]. Tomography [344]. Tool[876, 960, 1269, 1752, 509, 616, 939, 1126,312, 1699, 1564, 1113, 756, 1137]. Tools[1112, 1047, 1021, 19]. Top [865]. Topic[1348, 1456]. Topographic [1731].Topological [643, 1712, 1412]. Topologies[1239]. Topology [1207, 1215]. Torque[161]. Total [388]. Tourist [938].

32

Tournament [155, 588]. Trace [404, 1174].Traces [419, 420]. Tracing[1297, 1115, 546, 1161]. tracings [496].Track [1335, 1342, 1327]. Trackies [261].Tracking [239, 136]. Tracks [1319, 200].Tractable [419, 31]. Trade [393, 350, 1089].Trade-Offs [393, 350, 1089]. Trademarks[485]. Tradeoffs [299]. Trading[1427, 1491]. Traditional [1033]. Traffic[1254]. Trained [1675, 1701]. Training[1633, 895, 898, 1679, 663, 951, 1663, 1659,979, 1645, 981, 953, 667, 1736, 959, 1071,956, 1668]. Traitor [546]. Transactional[17, 1478]. Transducer [301]. Transducers[706, 627]. Transducing [293]. Transfer[1576, 809, 540]. Transform [1522, 928].Transformation[1358, 1297, 67, 1566, 907, 1158, 62].Transformation-Based [907].Transformational [584]. Transformations[65]. Transitions [187]. Transitive [701].Translation [1331, 1050, 1325, 1317, 1318,1328, 1329, 1323, 1315, 1067, 15].Translation-Based [1325]. Translations[1343]. Translator [966]. Transmission[1214, 1752, 1249]. Transmit [1261].Transparent [1231]. Transposer [968, 964].Travel [1737, 959]. Traveling [1715].Treatment [702]. Tree [856, 921, 1415,1220, 192, 137, 122, 1460, 1159, 1151, 313,607, 294, 1442, 138, 44, 846, 301, 1512, 1414].Tree-Based [44]. Tree-Tuple [313]. Trees[46, 1441, 1409, 550, 1511, 440, 370, 1650,640, 1513, 602, 380, 852, 45]. Treewidth[1407]. Trend [1492]. Trends [1016]. Trial[1752, 1755]. Triangle [633]. Trigger [1695].Triggering [1307]. Trilearn [235].Triphasic [1595, 1596]. Truck [648, 1543].True [1094, 893]. Trust [515, 1479].Trustworthy [767]. Truth [474].TsinghuAeolus [220]. TTree [44]. TTSLI[313]. Tumours [1505]. Tuning[1785, 1127, 1579]. Tuple [313, 922].Tutorial [948]. TV [994]. Two

[1549, 1145, 411, 1639, 25, 1429, 1522, 1430,83, 95, 205, 546, 894, 1496, 886, 1142].Two-Class [894]. Two-Dimensional[1522, 1142]. Two-Level [1430, 546].Two-Pattern [83]. Two-Player [25].Two-Stage [1639]. Two-Tiered [205].Two-Way [411]. Type[781, 1767, 1423, 73, 701, 121, 589, 119].Type-Indexed [589]. Type-Safe [121, 119].Type-Theoretic [1423]. Typed [124, 460].Types [589, 118, 66, 1434]. Typhoon [676].Typing [982]. Typings [418].

Ubiquitous[1549, 1547, 1548, 1557, 1560, 1556, 15].UCFL [353]. UDP [1208]. UDP/IP [1208].Ulm [265]. Ultrametric [666]. Ultrasonic[217]. UML [327, 760]. UML-F [327].Unanticipated [108]. Unbiased [924].Uncertain [1453]. Uncertainty [1698].Understanding [1769]. Unfoldings [1095].Unification [1418, 574, 308]. Uniform[1189, 426, 1229, 448, 140]. Uniformly [96].UNILANG [173]. Uninitialized [394].Union [608, 999]. Unique [88]. Unit[109, 1533]. United [266, 1084]. UniTesK[733]. Units [1621, 723, 1578, 672].Universal [367, 1011, 936, 397].Universalization [416]. Universes [1425].University [261, 279, 1027]. Unknown[1487, 1635]. Unlocking [1006]. Unsafe[1248]. Unscaled [1623]. Unsupervised[1779, 1724, 1732, 1505, 1780, 1766]. UNSW[159]. until [1098]. Untrusted [1555].Up-Trend [1492]. Updates [72, 61, 132].Updating [1390]. UPMC [262, 243].UPMC-CFA [262, 243]. Upper [1052]. UQ[234, 248]. Urban [1015]. Usability[642, 328, 937, 1011]. Usable [1005]. Usage[1513, 954]. Use [1306, 1042, 827, 1043, 98].Used [282]. Useful [1057]. Usefulness[1016, 328]. User[876, 509, 1468, 1043, 940, 465, 207, 1471,966, 837, 934, 1035, 471, 1046].

33

User-Adpated [837]. User-Centered[940]. User-Modeling [471]. Users[1031, 1445, 1041, 1011, 1035, 1019, 984, 1243].Using [1331, 781, 1767, 856, 1751, 921, 686,1624, 1768, 746, 1492, 498, 899, 1781, 371,1632, 511, 1731, 47, 1189, 188, 666, 706, 745,744, 1775, 671, 1316, 987, 870, 329, 1521, 192,1297, 1483, 1597, 67, 1025, 1721, 1460, 751,908, 813, 1762, 1021, 859, 860, 1015, 1699, 27,1777, 346, 1627, 1445, 684, 485, 1151, 204,1020, 1655, 679, 338, 1520, 1470, 854, 950,1505, 1164, 1274, 1523, 487, 66, 1776, 1458,1321, 842, 326, 1462, 1660, 1662, 209, 1433,1301, 433, 1692, 814, 236, 1175, 646, 667,1564, 1158, 1323, 920, 1648, 977, 542, 1581].Using [1770, 1007, 747, 1709, 630, 1054, 504,1288, 722, 1072, 575, 1324, 1267, 1465, 743,1326, 596, 1404, 672, 557, 335, 221, 7, 1187,1532, 1310, 1172, 874, 217, 670, 481, 1256].Utaclir [1322]. Utility [1475, 172, 250].Utility- [250]. Utilizing [1756, 1533]. UvA[235]. UW [276].

Validation [1684, 346, 326, 884, 1506].Validity [534]. VAlloy [742]. Value[1092, 1168, 51, 1648]. valued [557]. Values[1533]. Variabilities [316]. Variability[1607, 317, 324]. Variable [644, 366].Variable-Sized [644, 366]. Variables[796, 1192, 587, 832, 574, 734, 138].Variance [118]. Variance-Based [118].Variant [309, 1729]. Variation[318, 336, 601]. Variational [1676].Variations [852]. Various [1014]. Varying[1258]. VBR [1219]. Vector[1785, 1644, 1687, 675, 1679, 671, 1680, 122,1778, 664, 668, 1628, 1711, 679, 689, 1776,678, 1692, 659, 1690, 1472, 1747, 1746, 682,1326, 672, 1509, 677, 670, 687, 1497].Vector-Based [1326]. Vectors [897, 849].Vehicle [41, 864]. Veneti [251]. Vergence[1771]. Verification [1775, 67, 757, 792, 751,1360, 748, 590, 1104, 55, 19, 743, 1774, 768].Verified [746, 1421]. Verifier [745, 1384].

Verifying [739, 1122, 521]. Version[785, 451]. Versions [541]. versus[551, 110, 656]. Vertex [426, 652]. Vertical[209]. Vertices [621, 370, 867]. Vessels[1272]. VI [289]. via[1707, 1553, 361, 602, 1475, 892, 1657].Vickie [949]. Video [1779, 498, 1220, 490,1222, 500, 1574, 499, 903, 470, 1526, 1780,505, 1770, 502, 913, 492, 506, 497].Video-on-Demand [1220].Videoconference [1780]. Videophones[1057]. View [168, 1460, 842]. View-Based[842]. Viewpoint [821]. ViperRoos[249, 189]. Virtual [960, 106, 1005, 1040,742, 734, 947, 996, 959, 962, 1001].Virtualization [1146]. Viseme [1523].Vision[179, 1031, 185, 239, 189, 1021, 844, 200, 162,1550, 209, 163, 240, 241, 174, 1019, 481].Vision-Based [239, 174, 481]. Visual[1603, 875, 1569, 1036, 485, 499, 1584, 170,873, 1773, 1017, 1763, 670, 1579, 39].Visualisation [1230]. Visualization[1647, 1731, 1063, 1517, 207, 1709, 471].Visually [1016, 970, 939, 974, 1047, 1015,1010, 1020, 1080, 1027, 1000, 1007, 1011,1003, 1001, 1071, 1057, 1009].Visually-Impaired [1080]. Viterbi [1256].VITIPI [989]. Vivo [1502, 1505]. VLSI[1637, 1777, 615]. VLSI/WSI [615].Vocabulary [706, 997, 1741]. Vocational[1070]. Voice [1758, 944]. Voice-Enabled[1758]. VoiceXML [944]. VoIP [1252].Volatile [1497]. Voluntary [1604]. Voting[710]. Vowel [672]. VQ [912]. VQ-based[912]. vs [1429, 353, 1194, 1089].

W [801]. Wagner [429]. Walk[643, 650, 977]. Walk-disabled [977].Walkie [195]. Walkie-Talkie [195].Walking [978, 269, 161]. Walks [851].Walls [1553]. Warehouse [1305, 1473].Warehouses [1474, 1148]. warping [877].Watermark [496]. Watermarking [1651].

REFERENCES 34

Wavelet [931, 1742]. Wavelet-Based [931].Waves [840]. Way[411, 109, 1292, 806, 762]. Ways [1074, 693].Weak [298, 1623, 1242, 134]. Weakest[1438]. Wear [1699]. Weather [717]. Web[823, 1031, 459, 1647, 835, 1044, 1459, 939,1106, 972, 1406, 819, 1231, 761, 943, 461,1553, 820, 1081, 1259, 1253, 1462, 822, 630,837, 1299, 721, 110]. Web-Oriented [820].Webspace [1309]. Weight[1637, 1257, 1273, 1472]. Weight-Vector[1472]. Weighted [706, 912, 348, 863].Weighting [1508]. Weights[1408, 1521, 1777]. Welch [1759]. Well[799, 1072]. Well-Foundedness [799].Wheeled [263]. Whitening [662]. Who[992]. Wide [1406, 1244, 1076, 1106].Widening [336]. Width [369]. Wiener[1624]. Wilcoxon [1729]. WinBraille[1049, 1051]. Window [1267]. Windows[688, 578, 1046, 1041]. Winnow [136].Wired [1267]. Wired-cum-Wireless[1267]. Wireless [1241, 1239, 1258, 1245,1257, 1262, 1099, 1267, 1254, 762]. within[609, 674, 1454, 1580, 96, 1230, 1348].without [181, 1598, 928, 1178, 848].Wizards [225]. Word[1045, 724, 816, 1693, 448, 695]. WordNet[1321, 719]. Words [629, 1458, 958].WordsEye [692]. Work [981]. Working[1333, 1525, 981]. Workloads[1109, 1177, 1152]. Workplace [1069].Workshop [1347]. World [1573, 1552, 544,198, 1593, 993, 886, 1304, 1106, 1406].World-Wide [1106]. Worldwide [1111].Wormhole [1211]. Wormhole-Routed[1211]. Wright [558, 280]. Write [1186].Writing [989]. Written [563, 1669, 705].Wrong [415]. WSD [694]. WWW [1300].

XML[458, 870, 1473, 1301, 116, 1007, 1221, 1464].XML-Based [1473, 1221]. XTR [610].

YabAI [160]. Years [1418]. Yielding [141].Yields [1582]. Yorkist [844]. Young[961, 972, 973, 969]. Yourself [577, 1055].YowAI [232]. YowAI-2001 [232]. Yue[181]. Yue-Fei [181].

z [968, 730]. Zeng01 [236]. Zheng [523].Zheng-Seberry [523]. Ziv [1519, 78].

ReferencesMeur:2002:EBC

[1] Anne-Francoise Le Meur, CharlesConsel, and Benoıt Escrig. Anenvironment for building customiz-able software components. LectureNotes in Computer Science, 2370:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

ny.com/link/service/series/0558/

bibs/2370/23700001.htm; http:/

/link.springer-ny.com/link/service/

series/0558/papers/2370/23700001.

pdf.

Sommer:2002:CBA

[2] Nicolas Le Sommer and FredericGuidec. A contract-based ap-proach of resource-constrained soft-ware deployment. Lecture Notesin Computer Science, 2370:15–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700015.htm; http:/


series/0558/papers/2370/23700015.

pdf.

REFERENCES 35

Mikic-Rakic:2002:ALS

[3] Marija Mikic-Rakic and Nenad Med-vidovic. Architecture-level support forsoftware component deployment in re-source constrained environments. Lec-ture Notes in Computer Science, 2370:31–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700031.htm; http:/


series/0558/papers/2370/23700031.

pdf.

Eisenbach:2002:EDJ

[4] Susan Eisenbach, Chris Sadler, andShakil Shaikh. Evolution of dis-tributed Java programs. LectureNotes in Computer Science, 2370:51–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700051.htm; http:/


series/0558/papers/2370/23700051.

pdf.

Rutherford:2002:REJ

[5] Matthew J. Rutherford, Kenneth An-derson, Antonio Carzaniga, Dennis He-imbigner, and Alexander L. Wolf. Re-configuration in the enterprise Jav-aBean component model. LectureNotes in Computer Science, 2370:67–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700067.htm; http:/


series/0558/papers/2370/23700067.

pdf.

Chen:2002:CFD

[6] Xuejun Chen and Martin Simons. Acomponent framework for dynamic re-configuration of distributed systems.Lecture Notes in Computer Science,2370:82–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.

springer-ny.com/link/service/series/

0558/bibs/2370/23700082.htm; http:

//link.springer-ny.com/link/service/

series/0558/papers/2370/23700082.

pdf.

Sudmann:2002:SDU

[7] Nils P. Sudmann and Dag Jo-hansen. Software deployment us-ing mobile agents. Lecture Notesin Computer Science, 2370:97–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700097.htm; http:/


series/0558/papers/2370/23700097.

pdf.

Hissam:2002:PPA

[8] Scott A. Hissam, Gabriel A. Moreno,Judith A. Stafford, and Kurt C. Wall-nau. Packaging predictable assembly.Lecture Notes in Computer Science,2370:108–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2370/23700108.htm; http:


REFERENCES 36

series/0558/papers/2370/23700108.

pdf.

Costanza:2002:DRA

[9] Pascal Costanza. Dynamic replace-ment of active objects in the gilgulprogramming language. Lecture Notesin Computer Science, 2370:125–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700125.htm; http:/


series/0558/papers/2370/23700125.

pdf.

Assmann:2002:BGC

[10] Uwe Aßmann. Beyond generic com-ponent parameters. Lecture Notesin Computer Science, 2370:141–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700141.htm; http:/


series/0558/papers/2370/23700141.

pdf.

Kniesel:2002:CCC

[11] Gunter Kniesel and Michael Auster-mann. CC4J — code cover-age for Java. Lecture Notesin Computer Science, 2370:155–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700155.htm; http:/


series/0558/papers/2370/23700155.

pdf.

Lowe:2002:SBC

[12] Welf Lowe and Markus Noga. Scenario-based connector optimization. LectureNotes in Computer Science, 2370:170–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700170.htm; http:/


series/0558/papers/2370/23700170.

pdf.

Bracciali:2002:ACM

[13] Andrea Bracciali, Antonio Brogi, andCarlos Canal. Adapting componentswith mismatching behaviours. LectureNotes in Computer Science, 2370:185–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700185.htm; http:/


series/0558/papers/2370/23700185.

pdf.

Nierstrasz:2002:CMF

[14] Oscar Nierstrasz, Gabriela Arevalo,Stephane Ducasse, Roel Wuyts, An-drew P. Black, Peter O. Muller, Chris-tian Zeidler, Thomas Genssler, andReinier van den Born. A compo-nent model for field devices. LectureNotes in Computer Science, 2370:200–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700200.htm; http:/


series/0558/papers/2370/23700200.

pdf.

REFERENCES 37

Wichadakul:2002:TSE

[15] Duangdao Wichadakul and KlaraNahrstedt. A translation systemfor enabling flexible and efficient de-ployment of QoS-aware applicationsin ubiquitous environments. LectureNotes in Computer Science, 2370:210–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700210.htm; http:/


series/0558/papers/2370/23700210.

pdf.

Marangozova:2002:ICC

[16] Vania Marangozova and Daniel Hagi-mont. An infrastructure for CORBAcomponent replication. Lecture Notesin Computer Science, 2370:222–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700222.htm; http:/


series/0558/papers/2370/23700222.

pdf.

Poernomo:2002:AES

[17] Iman Poernomo, Ralf Reussner, andHeinz Schmidt. Architectures of en-terprise systems: Modelling trans-actional contexts. Lecture Notesin Computer Science, 2370:233–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700233.htm; http:/


series/0558/papers/2370/23700233.

pdf.

Laszewski:2002:SCS

[18] Gregor von Laszewski, Eric Blau,Michael Bletzinger, Jarek Gawor,Peter Lane, Stuart Martin, andMichael Russell. Software, com-ponent, and service deployment incomputational grids. Lecture Notesin Computer Science, 2370:244–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700244.htm; http:/


series/0558/papers/2370/23700244.

pdf.

Rapicault:2002:MNT

[19] Pascal Rapicault, Jean-Paul Rigault,and Luc Bourlier. Model, notation,and tools for verification of protocol-based components assembly. LectureNotes in Computer Science, 2370:257–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2370/23700257.htm; http:/


series/0558/papers/2370/23700257.

pdf.

Anonymous:2002:AIaaah

[20] Anonymous. Author index. LectureNotes in Computer Science, 2370:269–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


papers/2370/2370auth.pdf.

REFERENCES 38

Kurshan:2002:MCA

[21] Robert P. Kurshan. Model check-ing and abstraction. Lecture Notesin Computer Science, 2371:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710001.htm; http:/


series/0558/papers/2371/23710001.

pdf.

Long:2002:RP

[22] Derek Long, Maria Fox, and MunaHamdi. Reformulation in planning.Lecture Notes in Computer Science,2371:18–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2371/23710018.htm; http:


series/0558/papers/2371/23710018.

pdf.

Mahadevan:2002:SAS

[23] Sridhar Mahadevan. Spatiotem-poral abstraction of stochastic se-quential processes. Lecture Notesin Computer Science, 2371:33–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710033.htm; http:/


series/0558/papers/2371/23710033.

pdf.

Mingozzi:2002:SSR

[24] Aristide Mingozzi. State space re-laxation and search strategies in dy-

namic programming. Lecture Notesin Computer Science, 2371:51–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710051.htm; http:/


series/0558/papers/2371/23710051.

pdf.

Cazenave:2002:AMT

[25] Tristan Cazenave. Admissible movesin two-player games. Lecture Notesin Computer Science, 2371:52–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710052.htm; http:/


series/0558/papers/2371/23710052.

pdf.

Choueiry:2002:DBL

[26] Berthe Y. Choueiry and Amy M.Davis. Dynamic bundling: Lesseffort for more solutions. LectureNotes in Computer Science, 2371:64–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710064.htm; http:/


series/0558/papers/2371/23710064.

pdf.

Hansen:2002:SHS

[27] Eric Hansen, Rong Zhou, andZhengzhu Feng. Symbolic heuristicsearch using decision diagrams. Lec-ture Notes in Computer Science, 2371:

REFERENCES 39

83–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710083.htm; http:/


series/0558/papers/2371/23710083.

pdf.

Heymann:2002:CHA

[28] Michael Heymann and Asaf Degani. Onthe construction of human-automationinterfaces by formal abstraction. Lec-ture Notes in Computer Science, 2371:99–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710099.htm; http:/


series/0558/papers/2371/23710099.

pdf.

Khatib:2002:POT

[29] Lina Khatib, Paul Morris, and RobertMorris. Pareto optimization oftemporal decisions. Lecture Notesin Computer Science, 2371:116–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710116.htm; http:/


series/0558/papers/2371/23710116.

pdf.

Kumar:2002:ITC

[30] T. K. Satish Kumar. An information-theoretic characterization of abstrac-tion in diagnosis and hypothesis se-lection. Lecture Notes in ComputerScience, 2371:126–??, 2002. CODEN

LNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://

link.springer-ny.com/link/service/

series/0558/bibs/2371/23710126.

htm; http://link.springer-ny.

com/link/service/series/0558/papers/

2371/23710126.pdf.

Miranker:2002:TQC

[31] Daniel Miranker, Malcolm C. Taylor,and Anand Padmanaban. A tractablequery cache by approximation. Lec-ture Notes in Computer Science, 2371:140–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710140.htm; http:/


series/0558/papers/2371/23710140.

pdf.

Mukhopadhyay:2002:AFA

[32] Supratik Mukhopadhyay and AndreasPodelski. An algebraic frameworkfor abstract model checking. LectureNotes in Computer Science, 2371:152–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710152.htm; http:/


series/0558/papers/2371/23710152.

pdf.

Neller:2002:ATD

[33] Todd W. Neller. Action timing dis-cretization with iterative-refinement.Lecture Notes in Computer Science,2371:170–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.

REFERENCES 40


0558/bibs/2371/23710170.htm; http:


series/0558/papers/2371/23710170.

pdf.

Parmar:2002:FAO

[34] Aarati Parmar. Formalizing approxi-mate objects and theories: Some ini-tial results. Lecture Notes in ComputerScience, 2371:178–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2371/23710178.



2371/23710178.pdf.

Ravindran:2002:MMH

[35] Balaraman Ravindran and Andrew G.Barto. Model minimization in hierar-chical reinforcement learning. LectureNotes in Computer Science, 2371:196–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710196.htm; http:/


series/0558/papers/2371/23710196.

pdf.

Stolle:2002:LOR

[36] Martin Stolle and Doina Precup.Learning options in reinforcementlearning. Lecture Notes in ComputerScience, 2371:212–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2371/23710212.



2371/23710212.pdf.

Vu:2002:ATN

[37] Xuan-Ha Vu, Djamila Sam-Haroud,and Marius-Calin Silaghi. Approxima-tion techniques for non-linear problemswith continuum of solutions. LectureNotes in Computer Science, 2371:224–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710224.htm; http:/


series/0558/papers/2371/23710224.

pdf.

Zanuttini:2002:ARP

[38] Bruno Zanuttini. Approximation ofrelations by propositional formulas:Complexity and semantics. LectureNotes in Computer Science, 2371:242–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710242.htm; http:/


series/0558/papers/2371/23710242.

pdf.

Zucker:2002:AVP

[39] Jean-Daniel Zucker, Nicolas Bredeche,and Lorenza Saitta. Abstracting vi-sual percepts to learn concepts. Lec-ture Notes in Computer Science, 2371:256–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710256.htm; http:/


REFERENCES 41

series/0558/papers/2371/23710256.

pdf.

Apolloni:2002:PMB

[40] Bruno Apolloni, Fabio Baraghini, andGiorgio Palmas. PAC meditationon Boolean formulas. Lecture Notesin Computer Science, 2371:274–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710274.htm; http:/


series/0558/papers/2371/23710274.

pdf.

Beck:2002:RVR

[41] J. Christopher Beck, Patrick Prosser,and Evgeny Selensky. On the re-formulation of vehicle routing prob-lems and scheduling problems. LectureNotes in Computer Science, 2371:282–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710282.htm; http:/


series/0558/papers/2371/23710282.

pdf.

Kumar:2002:OCM

[42] T. K. Satish Kumar and Richard Dear-den. The oracular constraints method.Lecture Notes in Computer Science,2371:290–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2371/23710290.htm; http:


series/0558/papers/2371/23710290.

pdf.

Levner:2002:PLC

[43] Ilya Levner, Vadim Bulitko, OmidMadani, and Russell Greiner. Per-formance of lookahead control poli-cies in the face of abstractionsand approximations. Lecture Notesin Computer Science, 2371:299–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710299.htm; http:/


series/0558/papers/2371/23710299.

pdf.

Uther:2002:TTB

[44] William T. B. Uther and Manuela M.Veloso. TTree: Tree-based stategeneralization with temporally ab-stract actions. Lecture Notesin Computer Science, 2371:308–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710308.htm; http:/


series/0558/papers/2371/23710308.

pdf.

Zhang:2002:ODI

[45] Jun Zhang, Adrian Silvescu, and Vas-ant Honavar. Ontology-driven in-duction of decision trees at multi-ple levels of abstraction. LectureNotes in Computer Science, 2371:316–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 42


bibs/2371/23710316.htm; http:/


series/0558/papers/2371/23710316.

pdf.

Billings:2002:AII

[46] Darse Billings. Abstracting imper-fect information game trees. LectureNotes in Computer Science, 2371:324–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710324.htm; http:/


series/0558/papers/2371/23710324.

pdf.

Botea:2002:UAH

[47] Adi Botea. Using abstraction forheuristic search and planning. LectureNotes in Computer Science, 2371:326–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710326.htm; http:/


series/0558/papers/2371/23710326.

pdf.

Bowling:2002:ATM

[48] Michael Bowling. Approximation tech-niques in multiagent learning. LectureNotes in Computer Science, 2371:328–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710328.htm; http:/


series/0558/papers/2371/23710328.

pdf.

Buettner:2002:ARG

[49] Daniel Buettner. Abstraction and re-formulation in GraphPlan. LectureNotes in Computer Science, 2371:330–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710330.htm; http:/


series/0558/papers/2371/23710330.

pdf.

Clement:2002:ARP

[50] Bradley J. Clement. Abstract reason-ing for planning and coordination. Lec-ture Notes in Computer Science, 2371:331–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710331.htm; http:/


series/0558/papers/2371/23710331.

pdf.

Gelman:2002:RSA

[51] Irit Askira Gelman. Researchsummary: Abstraction techniques,and their value. Lecture Notesin Computer Science, 2371:333–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710333.htm; http:/


series/0558/papers/2371/23710333.

pdf.

REFERENCES 43

Glaubius:2002:RNB

[52] Robert Glaubius. Reformulation ofnon-binary constraints. Lecture Notesin Computer Science, 2371:335–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710335.htm; http:/


series/0558/papers/2371/23710335.

pdf.

Kumar:2002:RCO

[53] T. K. Satish Kumar. Reformulat-ing combinatorial optimization as con-straint satisfaction. Lecture Notesin Computer Science, 2371:336–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710336.htm; http:/


series/0558/papers/2371/23710336.

pdf.

McGovern:2002:ADA

[54] Amy McGovern. Autonomous discov-ery of abstractions through interac-tion with an environment. LectureNotes in Computer Science, 2371:338–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710338.htm; http:/


series/0558/papers/2371/23710338.

pdf.

Oishi:2002:IVD

[55] Meeko Oishi. Interface verifi-cation: Discrete abstractions ofhybrid systems. Lecture Notesin Computer Science, 2371:340–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710340.htm; http:/


series/0558/papers/2371/23710340.

pdf.

Okubo:2002:LSL

[56] Yoshiaki Okubo and Xiaobo Li. Learn-ing semi-lattice codebooks for im-age compression. Lecture Notesin Computer Science, 2371:342–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710342.htm; http:/


series/0558/papers/2371/23710342.

pdf.

Pickett:2002:RS

[57] Marc Pickett. Research summary. Lec-ture Notes in Computer Science, 2371:344–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710344.htm; http:/


series/0558/papers/2371/23710344.

pdf.

Ruml:2002:PEH

[58] Wheeler Ruml. Principled exploita-tion of heuristic information. Lecture

REFERENCES 44

Notes in Computer Science, 2371:345–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710345.htm; http:/


series/0558/papers/2371/23710345.

pdf.

Xu:2002:RTC

[59] Lin Xu. Reformulation of temporalconstraint networks. Lecture Notesin Computer Science, 2371:347–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2371/23710347.htm; http:/


series/0558/papers/2371/23710347.

pdf.

Anonymous:2002:AIaaai




Shankar:2002:SAS

[61] Natarajan Shankar. Static anal-ysis for safe destructive updatesin a functional language. LectureNotes in Computer Science, 2372:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720001.htm; http:/


series/0558/papers/2372/23720001.

pdf.

Potikas:2002:TTD

[62] Petros Potikas, Panos Rondogiannis,and Manolis Gergatsoulis. A transfor-mation technique for datalog programsbased on non-deterministic constructs.Lecture Notes in Computer Science,2372:25–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2372/23720025.htm; http:


series/0558/papers/2372/23720025.

pdf.

Kakehi:2002:DPA

[63] Kazuhiko Kakehi, Robert Gluck, andYoshihiko Futamura. On deforestingparameters of accumulating maps. Lec-ture Notes in Computer Science, 2372:46–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720046.htm; http:/


series/0558/papers/2372/23720046.

pdf.

Osorio:2002:EAS

[64] Mauricio Osorio, Juan A. Navarro,and Jose Arrazola. Equivalence inanswer set programming. LectureNotes in Computer Science, 2372:57–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720057.htm; http:/


REFERENCES 45

series/0558/papers/2372/23720057.

pdf.

Delzanno:2002:PTT

[65] Giorgio Delzanno and Sandro Etalle.Proof theory, transformations, andlogic programming for debugging se-curity protocols. Lecture Notesin Computer Science, 2372:76–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720076.htm; http:/


series/0558/papers/2372/23720076.

pdf.

Leuschel:2002:ACP

[66] Michael Leuschel and Stefan Gruner.Abstract conjunctive partial deduc-tion using regular types and its ap-plication to model checking. LectureNotes in Computer Science, 2372:91–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720091.htm; http:/


series/0558/papers/2372/23720091.

pdf.

Fioravanti:2002:VSI

[67] Fabio Fioravanti, Alberto Pettorossi,and Maurizio Proietti. Verificationof sets of infinite state processes us-ing program transformation. LectureNotes in Computer Science, 2372:111–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720111.htm; http:/


series/0558/papers/2372/23720111.

pdf.

Vanhoof:2002:WSD

[68] Wim Vanhoof and Maurice Bruynooghe.When size does matter. LectureNotes in Computer Science, 2372:129–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720129.htm; http:/


series/0558/papers/2372/23720129.

pdf.

Albert:2002:SPM

[69] Elvira Albert and German Vidal.Symbolic profiling for multi-paradigmdeclarative languages. Lecture Notesin Computer Science, 2372:148–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720148.htm; http:/


series/0558/papers/2372/23720148.

pdf.

Lau:2002:COO

[70] Kung-Kiu Lau and Mario Ornaghi.Correct object-oriented systems incomputational logic. Lecture Notesin Computer Science, 2372:168–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720168.htm; http:/


REFERENCES 46

series/0558/papers/2372/23720168.

pdf.

Ferre:2002:FDE

[71] Sebastien Ferre and Olivier Ridoux.A framework for developing embed-dable customized logics. Lecture Notesin Computer Science, 2372:191–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720191.htm; http:/


series/0558/papers/2372/23720191.

pdf.

Alferes:2002:CEA

[72] Jose J. Alferes, Antonio Brogi, Joao A.Leite, and Luıs M. Pereira. Computingenvironment-aware agent behaviourswith logic program updates. LectureNotes in Computer Science, 2372:216–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720216.htm; http:/


series/0558/papers/2372/23720216.

pdf.

Caldwell:2002:EGR

[73] James L. Caldwell. Extracting gen-eral recursive program schemes innuprl’s type theory. Lecture Notesin Computer Science, 2372:233–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720233.htm; http:/


series/0558/papers/2372/23720233.

pdf.

Ferrari:2002:EET

[74] Mauro Ferrari, Camillo Fiorentini, andMario Ornaghi. Extracting exact timebounds from logical proofs. LectureNotes in Computer Science, 2372:245–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2372/23720245.htm; http:/


series/0558/papers/2372/23720245.

pdf.

Anonymous:2002:AIaaaj




Ogasawara:2002:PSA

[76] Jun Ogasawara and Shinichi Mor-ishita. Practical software for align-ing ESTs to human genome. LectureNotes in Computer Science, 2373:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730001.htm; http:/


series/0558/papers/2373/23730001.

pdf.

Arimura:2002:ETM

[77] Hiroki Arimura. Efficient text miningwith optimized pattern discovery. Lec-

REFERENCES 47

ture Notes in Computer Science, 2373:17–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730017.htm; http:/


series/0558/papers/2373/23730017.

pdf.

Rytter:2002:ALZ

[78] Wojciech Rytter. Application ofLempel–Ziv factorization to the ap-proximation of grammar-based com-pression. Lecture Notes in ComputerScience, 2373:20–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2373/23730020.



2373/23730020.pdf.

Wan:2002:BML

[79] Raymond Wan and Alistair Moffat.Block merging for off-line compression.Lecture Notes in Computer Science,2373:32–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2373/23730032.htm; http:


series/0558/papers/2373/23730032.

pdf.

Rautio:2002:SMS

[80] Jussi Rautio, Jani Tanninen, andJorma Tarhio. String match-ing with stopper encoding andcode splitting. Lecture Notesin Computer Science, 2373:42–??,

2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730042.htm; http:/


series/0558/papers/2373/23730042.

pdf.

Vialette:2002:PMP

[81] Stephane Vialette. Pattern matchingproblems over 2-interval sets. LectureNotes in Computer Science, 2373:53–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730053.htm; http:/


series/0558/papers/2373/23730053.

pdf.

Chakaravarthy:2002:PCS

[82] Venkatesan T. Chakaravarthy and Ra-jasekar Krishnamurthy. The problem ofcontext sensitive string matching. Lec-ture Notes in Computer Science, 2373:64–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730064.htm; http:/


series/0558/papers/2373/23730064.

pdf.

Franek:2002:TPS

[83] Frantisek Franek, Jiandong Jiang,Weilin Lu, and William F. Smyth.Two-pattern strings. Lecture Notesin Computer Science, 2373:76–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 48

tronic). URL http://link.springer-


bibs/2373/23730076.htm; http:/


series/0558/papers/2373/23730076.

pdf.

Shapira:2002:EDM

[84] Dana Shapira and James A. Storer.Edit distance with move operations.Lecture Notes in Computer Science,2373:85–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2373/23730085.htm; http:


series/0558/papers/2373/23730085.

pdf.

Alber:2002:TOS

[85] Jochen Alber, Jens Gramm, JiongGuo, and Rolf Niedermeier. To-wards optimally solving the LONGESTCOMMON SUBSEQUENCE problemfor sequences with nested arc an-notations in linear time. LectureNotes in Computer Science, 2373:99–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730099.htm; http:/


series/0558/papers/2373/23730099.

pdf.

Makinen:2002:LSB

[86] Veli Makinen and Esko Ukkonen. Localsimilarity based point-pattern match-ing. Lecture Notes in Computer Sci-ence, 2373:115–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),

1611-3349 (electronic). URL http://


series/0558/bibs/2373/23730115.



2373/23730115.pdf.

Iliopoulos:2002:IOM

[87] Costas S. Iliopoulos, Christos Makris,Spiros Sioutas, Athanasios Tsaka-lidis, and Kostas Tsichlas. Identi-fying occurrences of maximal pairsin multiple strings. Lecture Notesin Computer Science, 2373:133–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730133.htm; http:/


series/0558/papers/2373/23730133.

pdf.

Hon:2002:SEA

[88] Wing-Kai Hon and Kunihiko Sadakane.Space-economical algorithms for find-ing maximal unique matches. LectureNotes in Computer Science, 2373:144–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730144.htm; http:/


series/0558/papers/2373/23730144.

pdf.

Inenaga:2002:MDA

[89] Shunsuke Inenaga, Masayuki Takeda,Ayumi Shinohara, Hiromasa Hoshino,and Setsuo Arikawa. The minimumDAWG for all suffixes of a stringand its applications. Lecture Notes

REFERENCES 49

in Computer Science, 2373:153–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730153.htm; http:/


series/0558/papers/2373/23730153.

pdf.

Akutsu:2002:CDP

[90] Tatsuya Akutsu, Hideo Bannai, SatoruMiyano, and Sascha Ott. On thecomplexity of deriving position specificscore matrices from examples. LectureNotes in Computer Science, 2373:168–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730168.htm; http:/


series/0558/papers/2373/23730168.

pdf.

Crochemore:2002:THM

[91] Maxime Crochemore, Costas S. Il-iopoulos, Thierry Lecroq, WojciechPlandowski, and Wojciech Rytter.Three heuristics for δ-matching:δ-BM algorithms. Lecture Notesin Computer Science, 2373:178–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730178.htm; http:/


series/0558/papers/2373/23730178.

pdf.

Brejova:2002:BML

[92] Brona Brejova and Tomas Vinar. A

better method for length distribu-tion modeling in HMMs and its ap-plication to gene finding. LectureNotes in Computer Science, 2373:190–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730190.htm; http:/


series/0558/papers/2373/23730190.

pdf.

Hyyro:2002:FBP

[93] Heikki Hyyro and Gonzalo Navarro.Faster bit-parallel approximate stringmatching. Lecture Notes in ComputerScience, 2373:203–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2373/23730203.



2373/23730203.pdf.

Burkhardt:2002:OGG

[94] Stefan Burkhardt and Juha Karkkainen.One-gapped q-gram filtersfor Lev-enshtein distance. Lecture Notesin Computer Science, 2373:225–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730225.htm; http:/


series/0558/papers/2373/23730225.

pdf.

Fredriksson:2002:OEF

[95] Kimmo Fredriksson, Gonzalo Navarro,and Esko Ukkonen. Optimal exact and

REFERENCES 50

fast approximate two dimensional pat-tern matching allowing rotations. Lec-ture Notes in Computer Science, 2373:235–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730235.htm; http:/


series/0558/papers/2373/23730235.

pdf.

Sahinalp:2002:SIU

[96] S. Cenk Sahinalp, Evan Eichler, PaulGoldberg, Petra Berenbrink, TomFriedetzky, and Funda Ergun. Sta-tistical identification of uniformly mu-tated segments within repeats. LectureNotes in Computer Science, 2373:249–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730249.htm; http:/


series/0558/papers/2373/23730249.

pdf.

Muthukrishnan:2002:SPS

[97] S. Muthu Muthukrishnan and S. CenkSahinalp. Simple and practicalsequence nearest neighbors withblock operations. Lecture Notesin Computer Science, 2373:262–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730262.htm; http:/


series/0558/papers/2373/23730262.

pdf.

Ilie:2002:COU

[98] Lucian Ilie and Sheng Yu. Construct-ing NFAs by optimal use of posi-tions in regular expressions. LectureNotes in Computer Science, 2373:279–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2373/23730279.htm; http:/


series/0558/papers/2373/23730279.

pdf.

Anonymous:2002:AIaaak



papers/2373/2373ind.pdf.

Meseguer:2002:SMD

[100] Jose Meseguer and Carolyn Tal-cott. Semantic models for dis-tributed object reflection. LectureNotes in Computer Science, 2374:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740001.htm; http:/


series/0558/papers/2374/23740001.

pdf.

Kienzle:2002:ADI

[101] Jorg Kienzle and Rachid Guerraoui.AOP: Does it make sense? the caseof concurrency and failures. LectureNotes in Computer Science, 2374:37–??, 2002. CODEN LNCSD9. ISSN

REFERENCES 51

0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740037.htm; http:/


series/0558/papers/2374/23740037.

pdf.

Ichisugi:2002:DBM

[102] Yuuji Ichisugi and Akira Tanaka.Difference-based modules: A class-independent module mechanism. Lec-ture Notes in Computer Science, 2374:62–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740062.htm; http:/


series/0558/papers/2374/23740062.

pdf.

Ostermann:2002:DCC

[103] Klaus Ostermann. Dynamicallycomposable collaborations with del-egation layers. Lecture Notesin Computer Science, 2374:89–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740089.htm; http:/


series/0558/papers/2374/23740089.

pdf.

Bacon:2002:STE

[104] David F. Bacon, Stephen J. Fink,and David Grove. Space- andtime-efficient implementation of theJava object model. Lecture Notesin Computer Science, 2374:111–??,2002. CODEN LNCSD9. ISSN



bibs/2374/23740111.htm; http:/


series/0558/papers/2374/23740111.

pdf.

Hovemeyer:2002:AIJ

[105] David Hovemeyer, William Pugh,and Jaime Spacco. Atomic in-structions in Java. Lecture Notesin Computer Science, 2374:133–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740133.htm; http:/


series/0558/papers/2374/23740133.

pdf.

Czajkowski:2002:CSA

[106] Grzegorz Czajkowski, Laurent Daynes,and Nathaniel Nystrom. Code shar-ing among virtual machines. LectureNotes in Computer Science, 2374:155–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740155.htm; http:/


series/0558/papers/2374/23740155.

pdf.

Tilevich:2002:JOA

[107] Eli Tilevich and Yannis Smaragdakis.J-orchestra: Automatic Java appli-cation partitioning. Lecture Notesin Computer Science, 2374:178–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 52



bibs/2374/23740178.htm; http:/


series/0558/papers/2374/23740178.

pdf.

Redmond:2002:SUD

[108] Barry Redmond and Vinny Cahill.Supporting unanticipated dynamicadaptation of application behaviour.Lecture Notes in Computer Science,2374:205–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2374/23740205.htm; http:


series/0558/papers/2374/23740205.

pdf.

Cheon:2002:SPA

[109] Yoonsik Cheon and Gary T. Leavens. Asimple and practical approach to unittesting: The JML and JUnit way. Lec-ture Notes in Computer Science, 2374:231–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740231.htm; http:/


series/0558/papers/2374/23740231.

pdf.

Szyperski:2002:OCV

[110] Clemens Szyperski. Objectively: Com-ponents versus Web services. LectureNotes in Computer Science, 2374:256–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740256.htm; http:/


series/0558/papers/2374/23740256.

pdf.

Rinat:2002:MIP

[111] Ran Rinat and Scott Smith. ModularInternet programming with cells. Lec-ture Notes in Computer Science, 2374:257–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740257.htm; http:/


series/0558/papers/2374/23740257.

pdf.

Bryce:2002:LAP

[112] Ciaran Bryce, Chrislain Razafima-hefa, and Michel Pawlak. Lana:An approach to programming au-tonomous systems. Lecture Notesin Computer Science, 2374:281–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740281.htm; http:/


series/0558/papers/2374/23740281.

pdf.

Fiege:2002:EEB

[113] Ludger Fiege, Mira Mezini, GeroMuhl, and Alejandro P. Buch-mann. Engineering event-based sys-tems with scopes. Lecture Notesin Computer Science, 2374:309–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 53

bibs/2374/23740309.htm; http:/


series/0558/papers/2374/23740309.

pdf.

Aldrich:2002:ARA

[114] Jonathan Aldrich, Craig Chambers,and David Notkin. Architectural rea-soning in ArchJava. Lecture Notesin Computer Science, 2374:334–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740334.htm; http:/


series/0558/papers/2374/23740334.

pdf.

Noble:2002:PS

[115] James Noble and Robert Biddle.Patterns as signs. Lecture Notesin Computer Science, 2374:368–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740368.htm; http:/


series/0558/papers/2374/23740368.

pdf.

Neumann:2002:PBD

[116] Gustaf Neumann and Uwe Zdun.Pattern-based design and implemen-tation of an XML and RDF parserand interpreter: A case study. Lec-ture Notes in Computer Science, 2374:392–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740392.htm; http:/


series/0558/papers/2374/23740392.

pdf.

Benton:2002:MCA

[117] Nick Benton, Luca Cardelli, and CedricFournet. Modern concurrency ab-stractions for C]. Lecture Notesin Computer Science, 2374:415–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740415.htm; http:/


series/0558/papers/2374/23740415.

pdf.

Igarashi:2002:VBS

[118] Atsushi Igarashi and Mirko Vi-roli. On variance-based subtypingfor parametric types. Lecture Notesin Computer Science, 2374:441–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740441.htm; http:/


series/0558/papers/2374/23740441.

pdf.

Zenger:2002:TSP

[119] Matthias Zenger. Type-safe prototype-based component evolution. LectureNotes in Computer Science, 2374:470–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740470.htm; http:/


REFERENCES 54

series/0558/papers/2374/23740470.

pdf.

Arnold:2002:TGS

[120] Matthew Arnold and Barbara G. Ry-der. Thin guards: A simple and effec-tive technique for reducing the penaltyof dynamic class loading. LectureNotes in Computer Science, 2374:498–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740498.htm; http:/


series/0558/papers/2374/23740498.

pdf.

Glew:2002:TSM

[121] Neal Glew and Jens Palsberg. Type-safe method inlining. Lecture Notesin Computer Science, 2374:525–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740525.htm; http:/


series/0558/papers/2374/23740525.

pdf.

Filman:2002:PEB

[122] Robert E. Filman. Polychotomic en-coding: A better quasi-optimal bit-vector encoding of tree hierarchies. Lec-ture Notes in Computer Science, 2374:545–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740545.htm; http:/


series/0558/papers/2374/23740545.

pdf.

Snelting:2002:SBC

[123] Gregor Snelting and Frank Tip.Semantics-based composition of classhierarchies. Lecture Notes in ComputerScience, 2374:562–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2374/23740562.



2374/23740562.pdf.

Alagic:2002:BCS

[124] Suad Alagic and Svetlana Kouznetsova.Behavioral compatibility of self-typed theories. Lecture Notesin Computer Science, 2374:585–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740585.htm; http:/


series/0558/papers/2374/23740585.

pdf.

Ancona:2002:FFJ

[125] Davide Ancona, Giovanni Lagorio, andElena Zucca. A formal framework forJava separate compilation. LectureNotes in Computer Science, 2374:609–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2374/23740609.htm; http:/


series/0558/papers/2374/23740609.

pdf.

REFERENCES 55

Anonymous:2002:AIaaal




Mendelson:2002:ALN

[127] Shahar Mendelson and Robert C.Williamson. Agnostic learning non-convex function classes. LectureNotes in Computer Science, 2375:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750001.htm; http:/


series/0558/papers/2375/23750001.

pdf.

Mendelson:2002:ECD

[128] Shahar Mendelson and Roman Ver-shynin. Entropy, combinatorial dimen-sions and random averages. LectureNotes in Computer Science, 2375:14–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750014.htm; http:/


series/0558/papers/2375/23750014.

pdf.

Mendelson:2002:GPK

[129] Shahar Mendelson. Geometric pa-rameters of kernel machines. LectureNotes in Computer Science, 2375:29–??, 2002. CODEN LNCSD9. ISSN



bibs/2375/23750029.htm; http:/


series/0558/papers/2375/23750029.

pdf.

Bartlett:2002:LRC

[130] Peter L. Bartlett, Olivier Bousquet,and Shahar Mendelson. LocalizedRademacher complexities. LectureNotes in Computer Science, 2375:44–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750044.htm; http:/


series/0558/papers/2375/23750044.

pdf.

Bousquet:2002:SLM

[131] Olivier Bousquet, Vladimir Koltchin-skii, and Dmitriy Panchenko. Some lo-cal measures of complexity of convexhulls and generalization bounds. Lec-ture Notes in Computer Science, 2375:59–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750059.htm; http:/


series/0558/papers/2375/23750059.

pdf.

Takimoto:2002:PKM

[132] Eiji Takimoto and Manfred K. War-muth. Path kernels and multi-plicative updates. Lecture Notesin Computer Science, 2375:74–??,2002. CODEN LNCSD9. ISSN

REFERENCES 56



bibs/2375/23750074.htm; http:/


series/0558/papers/2375/23750074.

pdf.

Vyugin:2002:PCI

[133] Michael V. Vyugin and Vladimir V.V’yugin. Predictive complexityand information. Lecture Notesin Computer Science, 2375:90–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750090.htm; http:/


series/0558/papers/2375/23750090.

pdf.

Kalnishkan:2002:MEW

[134] Yuri Kalnishkan and Michael V. Vyu-gin. Mixability and the existenceof weak complexities. Lecture Notesin Computer Science, 2375:105–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750105.htm; http:/


series/0558/papers/2375/23750105.

pdf.

Cesa-Bianchi:2002:SOP

[135] Nicolo Cesa-Bianchi, Alex Conconi,and Claudio Gentile. A second-order perceptron algorithm. LectureNotes in Computer Science, 2375:121–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2375/23750121.htm; http:/


series/0558/papers/2375/23750121.

pdf.

Mesterharm:2002:TLT

[136] Chris Mesterharm. Tracking linear-threshold concepts with winnow. Lec-ture Notes in Computer Science, 2375:138–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750138.htm; http:/


series/0558/papers/2375/23750138.

pdf.

Fernau:2002:LTL

[137] Henning Fernau. Learning tree lan-guages from text. Lecture Notesin Computer Science, 2375:153–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750153.htm; http:/


series/0558/papers/2375/23750153.

pdf.

Suzuki:2002:PTI

[138] Yusuke Suzuki, Ryuta Akanuma,Takayoshi Shoudai, Tetsuhiro Miya-hara, and Tomoyuki Uchida. Polyno-mial time inductive inference of orderedtree patterns with internal structuredvariables from positive data. LectureNotes in Computer Science, 2375:169–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 57



bibs/2375/23750169.htm; http:/


series/0558/papers/2375/23750169.

pdf.

Higuera:2002:IDL

[139] Colin de la Higuera and JoseOncina. Inferring deterministiclinear languages. Lecture Notesin Computer Science, 2375:185–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750185.htm; http:/


series/0558/papers/2375/23750185.

pdf.

Zilles:2002:MUI

[140] Sandra Zilles. Merging uniforminductive learners. Lecture Notesin Computer Science, 2375:201–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750201.htm; http:/


series/0558/papers/2375/23750201.

pdf.

Schmidhuber:2002:SPN

[141] Jurgen Schmidhuber. The speedprior: A new simplicity mea-sure yielding near-optimal com-putable predictions. Lecture Notesin Computer Science, 2375:216–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750216.htm; http:/


series/0558/papers/2375/23750216.

pdf.

Yang:2002:NLB

[142] Ke Yang. New lower bounds forstatistical query learning. LectureNotes in Computer Science, 2375:229–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750229.htm; http:/


series/0558/papers/2375/23750229.

pdf.

Bshouty:2002:ELB

[143] Nader H. Bshouty, Jeffrey C. Jackson,and Christino Tamon. Exploring learn-ability between exact and PAC. Lec-ture Notes in Computer Science, 2375:244–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750244.htm; http:/


series/0558/papers/2375/23750244.

pdf.

Even-Dar:2002:PBM

[144] Eyal Even-Dar, Shie Mannor, andYishay Mansour. PAC bounds formulti-armed bandit and Markov de-cision processes. Lecture Notesin Computer Science, 2375:255–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 58

bibs/2375/23750255.htm; http:/


series/0558/papers/2375/23750255.

pdf.

Bshouty:2002:BMD

[145] Nader H. Bshouty and Lynn Bur-roughs. Bounds for the minimumdisagreement problem with applica-tions to learning theory. LectureNotes in Computer Science, 2375:271–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750271.htm; http:/


series/0558/papers/2375/23750271.

pdf.

Bshouty:2002:PLA

[146] Nader H. Bshouty and Lynn Bur-roughs. On the proper learning ofaxis parallel concepts. Lecture Notesin Computer Science, 2375:287–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750287.htm; http:/


series/0558/papers/2375/23750287.

pdf.

Lugosi:2002:CSB

[147] Gabor Lugosi and Nicolas Vay-atis. A consistent strategy forboosting algorithms. Lecture Notesin Computer Science, 2375:303–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750303.htm; http:/


series/0558/papers/2375/23750303.

pdf.

Mannor:2002:CGA

[148] Shie Mannor, Ron Meir, and TongZhang. The consistency of greedy al-gorithms for classification. LectureNotes in Computer Science, 2375:319–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750319.htm; http:/


series/0558/papers/2375/23750319.

pdf.

Ratsch:2002:MMB

[149] Gunnar Ratsch and Manfred K.Warmuth. Maximizing the mar-gin with boosting. Lecture Notesin Computer Science, 2375:334–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750334.htm; http:/


series/0558/papers/2375/23750334.

pdf.

Dasgupta:2002:PGH

[150] Sanjoy Dasgupta. Performance guar-antees for hierarchical clustering. Lec-ture Notes in Computer Science, 2375:351–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750351.htm; http:/


REFERENCES 59

series/0558/papers/2375/23750351.

pdf.

Hutter:2002:SOP

[151] Marcus Hutter. Self-optimizing andpareto-optimal policies in general en-vironments based on Bayes-mixtures.Lecture Notes in Computer Science,2375:364–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2375/23750364.htm; http:


series/0558/papers/2375/23750364.

pdf.

Fortnow:2002:PD

[152] Lance Fortnow and Jack H. Lutz.Prediction and dimension. LectureNotes in Computer Science, 2375:380–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750380.htm; http:/


series/0558/papers/2375/23750380.

pdf.

Papadimitriou:2002:LI

[153] Christos Papadimitriou. Learn-ing the Internet. Lecture Notesin Computer Science, 2375:396–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2375/23750396.htm; http:/


series/0558/papers/2375/23750396.

pdf.

Anonymous:2002:AIaaam




Birk:2002:TRD

[155] Andreas Birk, Silvia Coradeschi, andSatoshi Tadokoro. The tourna-ment results of the different leaguesof robocup-2001. Lecture Notesin Computer Science, 2377:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770001.htm; http:/


series/0558/papers/2377/23770001.

pdf.

Cai:2002:GPL

[156] Yunpeng Cai, Jiang Chen, Jinyi Yao,and Shi Li. Global planning fromlocal eyeshot: An implementation ofobservation-based plan coordination inRoboCup simulation games. LectureNotes in Computer Science, 2377:12–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770012.htm; http:/


series/0558/papers/2377/23770012.

pdf.

Kiat:2002:LIT

[157] Ng Beng Kiat, Quek Yee Ming,Tay Boon Hock, Yuen Suen Yee,

REFERENCES 60

and Simon Koh. LuckyStar II —team description paper. LectureNotes in Computer Science, 2377:22–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770022.htm; http:/


series/0558/papers/2377/23770022.

pdf.

Weigel:2002:CF

[158] Thilo Weigel, Alexander Kleiner, Flo-rian Diesch, Markus Dietl, Jens-Steffen Gutmann, Bernhard Nebel,Patrick Stiegeler, and Boris Szer-bakowski. CS freiburg 2001. LectureNotes in Computer Science, 2377:26–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770026.htm; http:/


series/0558/papers/2377/23770026.

pdf.

Chen:2002:URS

[159] Spencer Chen, Martin Siu, ThomasVogelgesang, Tak Fai Yik, BernhardHengst, Son Bao Pham, and ClaudeSammut. The UNSW RoboCup 2001Sony Legged Robot League Team. Lec-ture Notes in Computer Science, 2377:39–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770039.htm; http:/


series/0558/papers/2377/23770039.

pdf.

Morimoto:2002:YFR

[160] Takeshi Morimoto, Kenji Kono, andIkuo Takeuchi. YabAI: The first res-cue simulation league champion. Lec-ture Notes in Computer Science, 2377:49–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770049.htm; http:/


series/0558/papers/2377/23770049.

pdf.

Yamasaki:2002:CMH

[161] Fuminori Yamasaki, Ken Endo, Mi-noru Asada, and Hiroaki Kitano. Acontrol method for humanoid bipedwalking with limited torque. LectureNotes in Computer Science, 2377:60–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770060.htm; http:/


series/0558/papers/2377/23770060.

pdf.

Jamzad:2002:FVS

[162] M. Jamzad, B. S. Sadjad, V. S.Mirrokni, M. Kazemi, H. Chitsaz,A. Heydarnoori, M. T. Hajiaghai, andE. Chiniforooshan. A fast vision systemfor middle size robots in RoboCup. Lec-ture Notes in Computer Science, 2377:71–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770071.htm; http:/


REFERENCES 61

series/0558/papers/2377/23770071.

pdf.

Menegatti:2002:DOV

[163] Emanuele Menegatti, Francesco Nori,Enrico Pagello, Carlo Pellizzari, andDavide Spagnoli. Designing an om-nidirectional vision system for agoalkeeper robot. Lecture Notesin Computer Science, 2377:81–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770081.htm; http:/


series/0558/papers/2377/23770081.

pdf.

Sear:2002:REF

[164] John A. Sear and Rupert W. Ford.RoboBase: An extensible frame-work supporting immediate remoteaccess to logfiles. Lecture Notesin Computer Science, 2377:92–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770092.htm; http:/


series/0558/papers/2377/23770092.

pdf.

Takahashi:2002:ABA

[165] Tomoichi Takahashi, Satoshi Ta-dokoro, Masayuki Ohta, and NobuhiroIto. Agent based approach in dis-aster rescue simulation — from test-bed of multiagent system to prac-tical application. Lecture Notesin Computer Science, 2377:102–??,2002. CODEN LNCSD9. ISSN



bibs/2377/23770102.htm; http:/


series/0558/papers/2377/23770102.

pdf.

Buck:2002:PEJ

[166] Sebastian Buck, Michael Beetz, andThorsten Schmitt. Planning and ex-ecuting joint navigation tasks in au-tonomous robot soccer. Lecture Notesin Computer Science, 2377:112–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770112.htm; http:/


series/0558/papers/2377/23770112.

pdf.

Casper:2002:CSH

[167] Jennifer Casper, Mark Micire, JeffHyams, and Robin Murphy. A casestudy of how mobile robot competi-tions promote future research. LectureNotes in Computer Science, 2377:123–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770123.htm; http:/


series/0558/papers/2377/23770123.

pdf.

Dietl:2002:CFG

[168] Markus Dietl, Jens-Steffen Gut-mann, and Bernhard Nebel. CSfreiburg: Global view by coop-erative sensing. Lecture Notes

REFERENCES 62



bibs/2377/23770133.htm; http:/


series/0558/papers/2377/23770133.

pdf.

Marques:2002:MSN

[169] Carlos F. Marques and Pedro U.Lima. Multi-sensor navigationfor soccer robots. Lecture Notesin Computer Science, 2377:144–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770144.htm; http:/


series/0558/papers/2377/23770144.

pdf.

Mitsunaga:2002:VAC

[170] Noriaki Mitsunaga and Minoru Asada.Visual attention control by sen-sor space segmentation for a smallquadruped robot based on infor-mation criterion. Lecture Notesin Computer Science, 2377:154–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770154.htm; http:/


series/0558/papers/2377/23770154.

pdf.

Noda:2002:LDR

[171] Itsuki Noda, Tomoichi Takahashi,Shuji Morita, Tetsuhiko Koto, and

Satoshi Tadokoro. Language designfor rescue agents. Lecture Notesin Computer Science, 2377:164–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770164.htm; http:/


series/0558/papers/2377/23770164.

pdf.

Obst:2002:SRA

[172] Oliver Obst. Specifying ratio-nal agents with statecharts andutility functions. Lecture Notesin Computer Science, 2377:173–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770173.htm; http:/


series/0558/papers/2377/23770173.

pdf.

Reis:2002:CUS

[173] Luis Paulo Reis and Nuno Lau.COACH UNILANG — A standard lan-guage for coaching a (robo)soccer team.Lecture Notes in Computer Science,2377:183–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770183.htm; http:


series/0558/papers/2377/23770183.

pdf.

Schmitt:2002:CPS

[174] Thorsten Schmitt, Robert Hanek, Se-bastian Buck, and Michael Beetz. Co-

REFERENCES 63

operative probabilistic state estima-tion for vision-based autonomous soc-cer robots. Lecture Notes in ComputerScience, 2377:193–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2377/23770193.



2377/23770193.pdf.

Sekimori:2002:HSO

[175] Daisuke Sekimori, Tomoya Usui, Ya-suhiro Masutani, and Fumio Miyazaki.High-speed obstacle avoidance andself-localization for mobile robotsbased on omni-directional imagingof floor region. Lecture Notesin Computer Science, 2377:204–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770204.htm; http:/


series/0558/papers/2377/23770204.

pdf.

Stone:2002:KSM

[176] Peter Stone and Richard S. Sut-ton. Keepaway soccer: A ma-chine learning testbed. Lecture Notesin Computer Science, 2377:214–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770214.htm; http:/


series/0558/papers/2377/23770214.

pdf.

Takahashi:2002:SLT

[177] Yasutake Takahashi, Takashi Tamura,and Minoru Asada. Strategylearning for a team in adver-sary environments. Lecture Notesin Computer Science, 2377:224–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770224.htm; http:/


series/0558/papers/2377/23770224.

pdf.

Uchibe:2002:EBS

[178] Eiji Uchibe, Masakazu Yanase, andMinoru Asada. Evolutionary be-havior selection with activation/termination constraints. Lecture Notesin Computer Science, 2377:234–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770234.htm; http:/


series/0558/papers/2377/23770234.

pdf.

Adorni:2002:SOD

[179] Giovanni Adorni, Luca Bolognini,Stefano Cagnoni, and Monica Mor-donini. Stereo obstacle detectionmethod for a hybrid omni-directional/pin-hole vision system. Lecture Notesin Computer Science, 2377:244–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770244.htm; http:/


REFERENCES 64

series/0558/papers/2377/23770244.

pdf.

Bach:2002:SLR

[180] Joscha Bach and Michael Gollin. Self-localisation revisited. Lecture Notesin Computer Science, 2377:251–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770251.htm; http:/


series/0558/papers/2377/23770251.

pdf.

Baltes:2002:YFO

[181] Jacky Baltes. Yue-fei: Objectorientation and id without addi-tional markers. Lecture Notesin Computer Science, 2377:257–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770257.htm; http:/


series/0558/papers/2377/23770257.

pdf.

Baltes:2002:EIP

[182] Jacky Baltes. Efficient imageprocessing for increased resolutionand color correctness of CMOSimage sensors. Lecture Notesin Computer Science, 2377:263–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770263.htm; http:/


series/0558/papers/2377/23770263.

pdf.

Baltes:2002:CSM

[183] Jacky Baltes and Yongjoo Park. Com-parison of several machine learningtechniques in pursuit-evasion games.Lecture Notes in Computer Science,2377:269–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770269.htm; http:


series/0558/papers/2377/23770269.

pdf.

Benosman:2002:SAC

[184] Ryad Benosman, Jerome Douret, andJean Devars. A simple and accu-rate camera calibration for the F180RoboCup league. Lecture Notesin Computer Science, 2377:275–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770275.htm; http:/


series/0558/papers/2377/23770275.

pdf.

Bianchi:2002:ICV

[185] Reinaldo A. C. Bianchi and Anna H.Reali-Costa. Implementing com-puter vision algorithms in hardware:An FPGA/VHDL-based vision sys-tem for a mobile robot. LectureNotes in Computer Science, 2377:281–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 65

bibs/2377/23770281.htm; http:/


series/0558/papers/2377/23770281.

pdf.

Bonarini:2002:FRS

[186] Andrea Bonarini, Matteo Matteucci,and Marcello Restelli. A frame-work for robust sensing in multi-agent systems. Lecture Notesin Computer Science, 2377:287–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770287.htm; http:/


series/0558/papers/2377/23770287.

pdf.

Bruce:2002:FPT

[187] James Bruce, Scott Lenser, andManuela Veloso. Fast parametric tran-sitions for smooth quadrupedal motion.Lecture Notes in Computer Science,2377:293–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770293.htm; http:


series/0558/papers/2377/23770293.

pdf.

Buhler:2002:BPT

[188] Paul Buhler and Jose M. Vidal. Biter:A platform for the teaching and re-search of multiagent systems’ de-sign using RoboCup. Lecture Notesin Computer Science, 2377:299–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770299.htm; http:/


series/0558/papers/2377/23770299.

pdf.

Chang:2002:VDL

[189] Mark M. Chang, Brett Browning, andGordon F. Wyeth. ViperRoos: De-veloping a low cost local vision teamfor the small size league. LectureNotes in Computer Science, 2377:305–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770305.htm; http:/


series/0558/papers/2377/23770305.

pdf.

Castelpietra:2002:DIC

[190] C. Castelpietra, A. Guidotti, L. Ioc-chi, D. Nardi, and R. Rosati. De-sign and implementation of cogni-tive soccer robots. Lecture Notesin Computer Science, 2377:312–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770312.htm; http:/


series/0558/papers/2377/23770312.

pdf.

Ciesielski:2002:GPR

[191] Vic Ciesielski, Dylan Mawhinney, andPeter Wilson. Genetic program-ming for robot soccer. Lecture Notesin Computer Science, 2377:319–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 66



bibs/2377/23770319.htm; http:/


series/0558/papers/2377/23770319.

pdf.

Drucker:2002:TGU

[192] Christian Drucker, Sebastian Hubner,Ubbo Visser, and Hans-Georg Weland.”as time goes by” — using time seriesbased decision tree induction to analyzethe behaviour of opponent players. Lec-ture Notes in Computer Science, 2377:325–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770325.htm; http:/


series/0558/papers/2377/23770325.

pdf.

Demura:2002:KCD

[193] Kosei Demura, Nobuhiro Tachi, Tet-suya Maekawa, and Tamaki Ueno.KENSEI-chan: Design of a hu-manoid for running. Lecture Notesin Computer Science, 2377:331–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770331.htm; http:/


series/0558/papers/2377/23770331.

pdf.

Figueras:2002:SRC

[194] Albert Figueras, Joan Colomer, Thor I.Fossen, and J. Lluis de la Rosa. Su-pervision of robot control. LectureNotes in Computer Science, 2377:337–

??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770337.htm; http:/


series/0558/papers/2377/23770337.

pdf.

Frank:2002:WTM

[195] Ian Frank, Kumiko Tanaka-Ishii, Hi-toshi Matsubara, and Eiichi Osawa.Walkie-talkie MIKE. Lecture Notesin Computer Science, 2377:343–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770343.htm; http:/


series/0558/papers/2377/23770343.

pdf.

Fukase:2002:QRN

[196] Takeshi Fukase, Masahiro Yokoi,Yuichi Kobayashi, Ryuichi Ueda, HideoYuasa, and Tamio Arai. Quadrupedrobot navigation considering the ob-servational cost. Lecture Notesin Computer Science, 2377:350–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770350.htm; http:/


series/0558/papers/2377/23770350.

pdf.

Gu:2002:EFL

[197] Dongbing Gu and Huosheng Hu.Evolving fuzzy logic controllers forSony legged robots. Lecture Notes

REFERENCES 67



bibs/2377/23770356.htm; http:/


series/0558/papers/2377/23770356.

pdf.

Haker:2002:MIN

[198] Martin Haker, Andre Meyer, DanielPolani, and Thomas Martinetz.A method for incorporation ofnew evidence to improve worldstate estimation. Lecture Notesin Computer Science, 2377:362–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770362.htm; http:/


series/0558/papers/2377/23770362.

pdf.

Hengst:2002:OLQ

[199] Bernhard Hengst, Darren Ibbotson,Son Bao Pham, and Claude Sam-mut. Omnidirectional locomotion forquadruped robots. Lecture Notesin Computer Science, 2377:368–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770368.htm; http:/


series/0558/papers/2377/23770368.

pdf.

Hundelshausen:2002:OVS

[200] Felix v. Hundelshausen, Sven Behnke,

and Raul Rojas. An omnidirec-tional vision system that finds andtracks color edges and blobs. LectureNotes in Computer Science, 2377:374–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770374.htm; http:/


series/0558/papers/2377/23770374.

pdf.

Hunter:2002:GAP

[201] Matthew Hunter and Huosheng Hu. Ageneralised approach to position selec-tion for simulated soccer agents. Lec-ture Notes in Computer Science, 2377:380–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770380.htm; http:/


series/0558/papers/2377/23770380.

pdf.

Indiveri:2002:MCN

[202] Giovanni Indiveri. On the mo-tion control of a nonholonomic soc-cer playing robot. Lecture Notesin Computer Science, 2377:387–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770387.htm; http:/


series/0558/papers/2377/23770387.

pdf.

Isekenmeier:2002:EPC

[203] Guido Isekenmeier, Bernhard Nebel,

REFERENCES 68

and Thilo Weigel. Evaluation ofthe performance of CS freiburg 1999and CS freiburg 2000. Lecture Notesin Computer Science, 2377:393–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770393.htm; http:/


series/0558/papers/2377/23770393.

pdf.

Johansson:2002:UEF

[204] Stefan J. Johansson and AlessandroSaffiotti. Using the electric field ap-proach in the RoboCup domain. Lec-ture Notes in Computer Science, 2377:399–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770399.htm; http:/


series/0558/papers/2377/23770399.

pdf.

Jong:2002:TTA

[205] Frank de Jong, Jurjen Caarls,Robert Bartelds, and Pieter P.Jonker. A two-tiered approachto self-localization. Lecture Notesin Computer Science, 2377:405–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770405.htm; http:/


series/0558/papers/2377/23770405.

pdf.

Kraetzschmar:2002:MMC

[206] Gerhard Kraetzschmar, Hans Utz, Ste-fan Sablatnog, Stefan Enderle, andGunther Palm. Miro — middle-ware for cooperative robotics. LectureNotes in Computer Science, 2377:411–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770411.htm; http:/


series/0558/papers/2377/23770411.

pdf.

Kuwata:2002:BUM

[207] Yoshitaka Kuwata and Atsushi Shin-joh. Building user models for robocup-rescue visualization. Lecture Notesin Computer Science, 2377:417–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770417.htm; http:/


series/0558/papers/2377/23770417.

pdf.

Lenser:2002:MHB

[208] Scott Lenser, James Bruce, andManuela Veloso. A modular hierarchi-cal behavior-based architecture. Lec-ture Notes in Computer Science, 2377:423–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770423.htm; http:/


series/0558/papers/2377/23770423.

pdf.

REFERENCES 69

Matsuoka:2002:LOD

[209] Takeshi Matsuoka, Manabu Araoka,Tsutomu Hasegawa, Akira Mohri,Motoji Yamamoto, Toshihiro Kiriki,Nobuhiro Ushimi, Takuya Sugimoto,Jyun’ichi Inoue, and Yuuki Yam-aguchi. Localization and obstaclesdetection using omni-directional ver-tical stereo vision. Lecture Notesin Computer Science, 2377:429–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770429.htm; http:/


series/0558/papers/2377/23770429.

pdf.

Merke:2002:KBR

[210] A. Merke and M. Riedmiller. Karlsruhebrainstormers — A reinforcementlearning approach to robotic soccer.Lecture Notes in Computer Science,2377:435–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770435.htm; http:


series/0558/papers/2377/23770435.

pdf.

Miene:2002:IST

[211] Andrea Miene and Ubbo Visser. In-terpretation of spatio-temporal rela-tions in real-time and dynamic envi-ronments. Lecture Notes in ComputerScience, 2377:441–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2377/23770441.



2377/23770441.pdf.

Pham:2002:SGD

[212] Son Bao Pham, Bernhard Hengst, Dar-ren Ibbotson, and Claude Sammut.Stochastic gradient descent localisa-tion in quadruped robots. LectureNotes in Computer Science, 2377:447–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770447.htm; http:/


series/0558/papers/2377/23770447.

pdf.

Riley:2002:RPO

[213] Patrick Riley and Manuela Veloso.Recognizing probabilistic opponentmovement models. Lecture Notesin Computer Science, 2377:453–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770453.htm; http:/


series/0558/papers/2377/23770453.

pdf.

Tu:2002:DIS

[214] Kuo-Yang Tu. Design and imple-mentation of a soccer robot withmodularized control circuits. LectureNotes in Computer Science, 2377:459–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770459.htm; http:/

REFERENCES 70


series/0558/papers/2377/23770459.

pdf.

Wang:2002:CBB

[215] Hui Wang, Han Wang, ChunmiaoWang, and William Y. C. Soh.Cooperation-based behavior design.Lecture Notes in Computer Science,2377:465–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770465.htm; http:


series/0558/papers/2377/23770465.

pdf.

Wang:2002:MPS

[216] Hui Wang, Han Wang, ChunmiaoWang, and William Y. C. Soh.Multi-platform soccer robot devel-opment system. Lecture Notesin Computer Science, 2377:471–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770471.htm; http:/


series/0558/papers/2377/23770471.

pdf.

Ushimi:2002:LNM

[217] Nobuhiro Ushimi, Motoji Yamamoto,Jyun’ichi Inoue, Takuya Sugimoto,Manabu Araoka, Takeshi Matsuoka,Toshihiro Kiriki, Yuuki Yamaguchi,Tsutomu Hasegawa, and Akira Mohri.On-line navigation of mobile robotamong moving obstacles using ul-trasonic sensors. Lecture Notesin Computer Science, 2377:477–??,



bibs/2377/23770477.htm; http:/


series/0558/papers/2377/23770477.

pdf.

Suzuki:2002:TD

[218] Keisuke Suzuki, Naotaka Tanaka,and Mio Yamamoto. 11monkeys3team description. Lecture Notesin Computer Science, 2377:484–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770484.htm; http:/


series/0558/papers/2377/23770484.

pdf.

Nazemi:2002:ASS

[219] Eslam Nazemi, Mahmood Rahmani,and Bahman Radjabalipour. 3T archi-tecture for the SBCe simulator team.Lecture Notes in Computer Science,2377:487–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770487.htm; http:


series/0558/papers/2377/23770487.

pdf.

Yao:2002:AT

[220] Jinyi Yao, Jiang Chen, YunpengCai, and Shi Li. Architectureof TsinghuAeolus. Lecture Notesin Computer Science, 2377:491–??,2002. CODEN LNCSD9. ISSN

REFERENCES 71



bibs/2377/23770491.htm; http:/


series/0558/papers/2377/23770491.

pdf.

Stone:2002:AUH

[221] Peter Stone. ATTUnited-2001: Us-ing heterogeneous players. LectureNotes in Computer Science, 2377:495–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770495.htm; http:/


series/0558/papers/2377/23770495.

pdf.

Browne:2002:BCS

[222] Keen Browne, Jon McCune, AdamTrost, David Evans, and David Bro-gan. Behavior combination andswarm programming. Lecture Notesin Computer Science, 2377:499–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770499.htm; http:/


series/0558/papers/2377/23770499.

pdf.

Carpenter:2002:CTD

[223] Paul Carpenter, Patrick Riley, GalKaminka, Manuela Veloso, Igna-cio Thayer, and Robert Wang.Chameleons-01 team description. Lec-ture Notes in Computer Science, 2377:503–??, 2002. CODEN LNCSD9. ISSN



bibs/2377/23770503.htm; http:/


series/0558/papers/2377/23770503.

pdf.

Prokopenko:2002:CDB

[224] Mikhail Prokopenko, Peter Wang, andThomas Howard. Cyberoos’2001:“Deep Behaviour Projection” agent ar-chitecture. Lecture Notes in ComputerScience, 2377:507–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2377/23770507.



2377/23770507.pdf.

Hu:2002:EWT

[225] Huosheng Hu, Kostas Kostiadis,Matthew Hunter, and Nikolaos Ka-lyviotis. Essex wizards 2001 team de-scription. Lecture Notes in ComputerScience, 2377:511–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2377/23770511.



2377/23770511.pdf.

Lau:2002:FPT

[226] Nuno Lau and Luis Paulo Reis.FC portugal 2001 team descrip-tion: Flexible teamwork and con-figurable strategy. Lecture Notesin Computer Science, 2377:515–??,2002. CODEN LNCSD9. ISSN

REFERENCES 72



bibs/2377/23770515.htm; http:/


series/0558/papers/2377/23770515.

pdf.

B:2002:HRT

[227] Bahador Nooraei B., Siavash RahbarN., and Omid Aladini. Helli-respina2001 team description paper. LectureNotes in Computer Science, 2377:519–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770519.htm; http:/


series/0558/papers/2377/23770519.

pdf.

Yuen:2002:LTD

[228] Anthony Yuen. Lazarus team de-scription. Lecture Notes in ComputerScience, 2377:522–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2377/23770522.



2377/23770522.pdf.

Murray:2002:RK

[229] Jan Murray, Oliver Obst, and FriederStolzenburg. RoboLog koblenz 2001.Lecture Notes in Computer Science,2377:526–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770526.htm; http:


series/0558/papers/2377/23770526.

pdf.

Arnold:2002:TDM

[230] A. Arnold, F. Flentge, Ch. Schnei-der, G. Schwandtner, Th. Uthmann,and M. Wache. Team descriptionmainz rolling brains 2001. LectureNotes in Computer Science, 2377:531–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770531.htm; http:/


series/0558/papers/2377/23770531.

pdf.

Esaki:2002:TDN

[231] Tetsuya Esaki, Taku Sakushima,Yoshiki Asai, and Nobuhiro Ito. Teamdescription of NITStones2001. LectureNotes in Computer Science, 2377:535–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770535.htm; http:/


series/0558/papers/2377/23770535.

pdf.

Nakayama:2002:TYD

[232] Koji Nakayama and Ikuo Takeuchi.Team YowAI-2001 description. LectureNotes in Computer Science, 2377:539–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770539.htm; http:/


REFERENCES 73

series/0558/papers/2377/23770539.

pdf.

Buttinger:2002:DDT

[233] Sean Buttinger, Marco Diedrich,Leo Hennig, Angelika Hoenemann,Philipp Huegelmeyer, Andreas Nie,Andres Pegam, Collin Rogowski, ClausRollinger, Timo Steffens, and Wil-fried Teiken. The dirty dozen teamand coach description. Lecture Notesin Computer Science, 2377:543–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770543.htm; http:/


series/0558/papers/2377/23770543.

pdf.

Wyeth:2002:UCI

[234] Gordon Wyeth, Mark Venz, HelenMayfield, Jun Akiyama, and RexHeathwood. UQ CrocaRoos: An initialentry to the simulation league. Lec-ture Notes in Computer Science, 2377:547–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770547.htm; http:/


series/0558/papers/2377/23770547.

pdf.

Boer:2002:UTT

[235] Remco de Boer, Jelle Kok, andFrans Groen. UvA trilearn 2001team description. Lecture Notesin Computer Science, 2377:551–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2377/23770551.htm; http:/


series/0558/papers/2377/23770551.

pdf.

Morishita:2002:ZTD

[236] Takuya Morishita, Hiroki Shimora,Kouichirou Hiratsuka, Takenori Kubo,Kyoichi Hiroshima, Raiko Funakami,Junji Nishino, Tomohiro Odaka, andHisakazu Ogura. Zeng01 team de-scription: Formation decision methodusing game theory. Lecture Notesin Computer Science, 2377:555–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770555.htm; http:/


series/0558/papers/2377/23770555.

pdf.

Baltes:2002:S

[237] Jacky Baltes. 4 stooges. LectureNotes in Computer Science, 2377:559–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770559.htm; http:/


series/0558/papers/2377/23770559.

pdf.

Costa:2002:TD

[238] Paulo Costa, Armando Sousa, PauloMarques, Pedro Costa, Susana Gaio,and Antonio Moreira. 5dpo team de-scription. Lecture Notes in ComputerScience, 2377:563–??, 2002. CODEN

REFERENCES 74



series/0558/bibs/2377/23770563.



2377/23770563.pdf.

Browning:2002:CDV

[239] Brett Browning, Michael Bowling,James Bruce, Ravi Balasubramanian,and Manuela Veloso. CM-Dragons’01— vision-based motion tracking andheteregenous robots. Lecture Notesin Computer Science, 2377:567–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770567.htm; http:/


series/0558/papers/2377/23770567.

pdf.

Rojas:2002:FFG

[240] Raul Rojas, Sven Behnke, AchimLiers, and Lars Knipping. FU-fighters2001 (global vision). Lecture Notesin Computer Science, 2377:571–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770571.htm; http:/


series/0558/papers/2377/23770571.

pdf.

Rojas:2002:FFO

[241] Raul Rojas, Felix von Hundelshausen,Sven Behnke, and Bernhard Frotschl.FU-fighters omni 2001 (local vision).Lecture Notes in Computer Science,

2377:575–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770575.htm; http:


series/0558/papers/2377/23770575.

pdf.

Hibino:2002:OTD

[242] Shinya Hibino, Yukiharu Kodama,Yasunori Nagasaka, Tomoichi Taka-hashi, Kazuhito Murakami, andTadashi Naruse. Owaribito — Ateam description. Lecture Notesin Computer Science, 2377:579–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770579.htm; http:/


series/0558/papers/2377/23770579.

pdf.

Bras:2002:RFT

[243] Francis Bras, Ryad Benosman, AndreAnglade, Seko Latidine, Olivier Mar-tino, Aude Lagardere, Alain Boun,Alain Testa, and Gilles Cordurie.RoboCup 2001 (F180) team descrip-tion: RoboSix UPMC-CFA (france).Lecture Notes in Computer Science,2377:583–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770583.htm; http:


series/0558/papers/2377/23770583.

pdf.

REFERENCES 75

Rosa:2002:RTD

[244] J. Ll. de la Rosa, B. Innocenti, M. Mon-taner, A. Figueras, I. Munoz, and J. A.Ramon. Rogi team description. Lec-ture Notes in Computer Science, 2377:587–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770587.htm; http:/


series/0558/papers/2377/23770587.

pdf.

Thomas:2002:R

[245] Jason Thomas, Kenichi Yoshimura,and Andrew Peel. Roobots. LectureNotes in Computer Science, 2377:591–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770591.htm; http:/


series/0558/papers/2377/23770591.

pdf.

Manzuri:2002:SCS

[246] Mohammad Taghi Manzuri, Hamid RezaChitsaz, Reza Ghorbani, Pooya Karim-ian, Alireza Mirazi, Mehran Mo-tamed, Roozbeh Mottaghi, and PayamSabzmeydani. Sharif CESR smallsize Robocup team. Lecture Notesin Computer Science, 2377:595–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770595.htm; http:/


series/0558/papers/2377/23770595.

pdf.

Sekimori:2002:TDT

[247] Daisuke Sekimori, Nobuhito Mori,Junichi Ieda, Wataru Matsui, Os-amu Miyake, Tomoya Usui, YukihisaTanaka, Dong Pyo Kim, TetsuhiroMaeda, Hirokazu Sugimoto, RyouheiFujimoto, Masaya Enomoto, YasuhiroMasutani, and Fumio Miyazaki. Theteam description of the team OMNI.Lecture Notes in Computer Science,2377:599–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770599.htm; http:


series/0558/papers/2377/23770599.

pdf.

Wyeth:2002:URA

[248] Gordon Wyeth, David Ball, DavidCusack, and Adrian Ratnapala. UQRoboRoos: Achieving power andagility in a small size robot. LectureNotes in Computer Science, 2377:603–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770603.htm; http:/


series/0558/papers/2377/23770603.

pdf.

Chang:2002:V

[249] Mark M. Chang and Gordon F.Wyeth. ViperRoos 2001. LectureNotes in Computer Science, 2377:607–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770607.htm; http:/

REFERENCES 76


series/0558/papers/2377/23770607.

pdf.

Schmitt:2002:ARU

[250] Thorsten Schmitt, Sebastian Buck, andMichael Beetz. AGILO RoboCup-pers 2001: Utility- and plan-based ac-tion selection based on probabilisti-cally estimated game situations. Lec-ture Notes in Computer Science, 2377:611–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770611.htm; http:/


series/0558/papers/2377/23770611.

pdf.

Pagello:2002:AVH

[251] E. Pagello, M. Bert, M. Barbon,E. Menegatti, C. Moroni, C. Pellizzari,D. Spagnoli, and S. Zaffalon. Artistiveneti: An heterogeneous robot teamfor the 2001 middle-size league. Lec-ture Notes in Computer Science, 2377:616–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770616.htm; http:/


series/0558/papers/2377/23770616.

pdf.

Jamzad:2002:BRT

[252] M. Jamzad, H. Chitsaz, A. Forough-nassirai, R. Ghorbani, M. Kazemi,V. S. Mirrokni, and B. S. Sadjad.Basic requirements for a teamworkin middle size RoboCup. LectureNotes in Computer Science, 2377:621–



bibs/2377/23770621.htm; http:/


series/0558/papers/2377/23770621.

pdf.

Spaan:2002:COD

[253] Matthijs Spaan, Marco Wiering,Robert Bartelds, Raymond Donker-voort, Pieter Jonker, and FransGroen. Clockwork Orange: TheDutch RoboSoccer team. LectureNotes in Computer Science, 2377:627–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770627.htm; http:/


series/0558/papers/2377/23770627.

pdf.

Stancliff:2002:CHT

[254] Steve Stancliff, Ravi Balasubra-manian, Tucker Balch, RosemaryEmery, Kevin Sikorski, and Ash-ley Stroupe. CMU hammerheads2001 team description. Lecture Notesin Computer Science, 2377:631–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770631.htm; http:/


series/0558/papers/2377/23770631.

pdf.

Lafrenz:2002:CTD

[255] R. Lafrenz, M. Becht, T. Buchheim,

REFERENCES 77

P. Burger, G. Hetzel, G. Kinder-mann, M. Schanz, M. Schule, andP. Levi. CoPS-team description. Lec-ture Notes in Computer Science, 2377:635–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770635.htm; http:/


series/0558/papers/2377/23770635.

pdf.

Bonarini:2002:FMR

[256] Andrea Bonarini, Giovanni Invernizzi,Fabio Marchese, Matteo Matteucci,Marcello Restelli, and DomenicoSorrenti. Fun2Mas: The Mi-lan Robocup team. Lecture Notesin Computer Science, 2377:639–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770639.htm; http:/


series/0558/papers/2377/23770639.

pdf.

Matsuoka:2002:F

[257] Takeshi Matsuoka, Motoji Yamamoto,Nobuhiro Ushimi, Jyun’ichi In-oue, Takuya Sugimoto, ManabuAraoka, Toshihiro Kiriki, Yuuki Ya-maguchi, Tsutomu Hasegawa, andAkira Mohri. Fusion. Lecture Notesin Computer Science, 2377:643–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770643.htm; http:/


series/0558/papers/2377/23770643.

pdf.

Bredenfeld:2002:GR

[258] Ansgar Bredenfeld, Vlatko Becanovic,Thomas Christaller, Horst Gunther,Giovanni Indiveri, Hans-Ulrich Ko-bialka, Paul-Gerhard Ploger, and Pe-ter Scholl. GMD-robots. LectureNotes in Computer Science, 2377:648–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770648.htm; http:/


series/0558/papers/2377/23770648.

pdf.

Lima:2002:ITD

[259] Pedro Lima, Luis Custodio, BrunoDamas, Manuel Lopes, Carlos Mar-ques, Luis Toscano, and Rodrigo Ven-tura. ISocRob 2001 team description.Lecture Notes in Computer Science,2377:653–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770653.htm; http:


series/0558/papers/2377/23770653.

pdf.

Ribeiro:2002:MRF

[260] Fernando Ribeiro, Carlos Machado,Sergio Sampaio, and Bruno Martins.MINHO robot football team for 2001.Lecture Notes in Computer Science,2377:657–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


REFERENCES 78

0558/bibs/2377/23770657.htm; http:


series/0558/papers/2377/23770657.

pdf.

Takahashi:2002:OUT

[261] Yasutake Takahashi, Shoichi Ikenoue,Shujiro Inui, Kouichi Hikita, YutakaKatoh, and Minoru Asada. OsakaUniversity “Trackies 2001”. LectureNotes in Computer Science, 2377:661–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770661.htm; http:/


series/0558/papers/2377/23770661.

pdf.

Benosman:2002:RUC

[262] Ryad Benosman, Francis Bras, Fred-eric Bach, Simon Boulay, EmmanuelleCahn, Sylvain Come, Gilles Cor-durie, Jarlegan Marie Annick, LapiedLoic, Cyrille Potereau, Franck Richard,Samedi Sath, Xavier Vasseur, and Pas-cal Vincent. ROBOSIX UPMC-CFA:RoboCup team description. LectureNotes in Computer Science, 2377:665–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770665.htm; http:/


series/0558/papers/2377/23770665.

pdf.

Iocchi:2002:PQR

[263] Luca Iocchi, Daniele Baldassari, FlavioCappelli, Alessandro Farinelli, GiorgioGrisetti, Floris Maathuis, and Daniele

Nardi. S.P.Q.R. wheeled team. Lec-ture Notes in Computer Science, 2377:669–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770669.htm; http:/


series/0558/papers/2377/23770669.

pdf.

Yoshida:2002:TDE

[264] Kazuo Yoshida, Ryoichi Tsuzaki, Ju-nichi Kougo, Takaaki Okabe, NobuyukiKurihara, Daiki Sakai, RyotakuHayashi, and Hikari Fujii. Teamdescription eigen. Lecture Notesin Computer Science, 2377:673–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770673.htm; http:/


series/0558/papers/2377/23770673.

pdf.

Utz:2002:US

[265] Hans Utz, Gerd Mayer, DominikMaschke, Alexander Neubeck, Pe-ter Schaeffer, Philipp Baer, Ing-mar Baetge, Jan Fischer, RolandHolzer, Markus Lauer, AlexanderReisser, Florian Sterk, Gunther Palm,and Gerhard Kraetzschmar. Theulm sparrows 2001. Lecture Notesin Computer Science, 2377:677–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770677.htm; http:/


REFERENCES 79

series/0558/papers/2377/23770677.

pdf.

Oda:2002:AKU

[266] Kentaro Oda, Takeshi Ohashi, ShuichiKouno, Kunio Gohara, ToyohiroHayashi, Takeshi Kato, Yuki Katsumi,and Toshiyuki Ishimura. ASURA:Kyushu united team in the fourlegged robot league. Lecture Notesin Computer Science, 2377:681–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770681.htm; http:/


series/0558/papers/2377/23770681.

pdf.

Mitsunaga:2002:BOL

[267] Noriaki Mitsunaga, Yukie Nagai, To-mohiro Ishida, Taku Izumi, and Mi-noru Asada. BabyTigers 2001: Os-aka legged robot team. Lecture Notesin Computer Science, 2377:685–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770685.htm; http:/


series/0558/papers/2377/23770685.

pdf.

Akin:2002:CTD

[268] H. Levent Akin, Andon Topalov,and Okyay Kaynak. Cerberus 2001team description. Lecture Notesin Computer Science, 2377:689–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770689.htm; http:/


series/0558/papers/2377/23770689.

pdf.

Uther:2002:CPF

[269] William Uther, Scott Lenser, JamesBruce, Martin Hock, and ManuelaVeloso. CM-Pack’01: Fast leggedrobot walking, robust localization,and team behaviors. Lecture Notesin Computer Science, 2377:693–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770693.htm; http:/


series/0558/papers/2377/23770693.

pdf.

Hu:2002:ERT

[270] Huosheng Hu, Dongbing Gu, DragosGolubovic, Bo Li, and Zhengyu Liu.Essex rovers 2001 team description.Lecture Notes in Computer Science,2377:697–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2377/23770697.htm; http:


series/0558/papers/2377/23770697.

pdf.

Hugel:2002:FLT

[271] Vincent Hugel, Olivier Stasse, PatrickBonnin, and Pierre Blazevic. FrenchLRP team’s description. LectureNotes in Computer Science, 2377:701–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 80



bibs/2377/23770701.htm; http:/


series/0558/papers/2377/23770701.

pdf.

Brunn:2002:G

[272] Ronnie Brunn, Uwe Duffert, MatthiasJungel, Tim Laue, Martin Lotzsch, Se-bastian Petters, Max Risler, ThomasRofer, Kai Spiess, and Andreas Sz-tybryc. GermanTeam 2001. LectureNotes in Computer Science, 2377:705–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770705.htm; http:/


series/0558/papers/2377/23770705.

pdf.

Sud:2002:MR

[273] Daniel Sud, Francois Cayouette,Gu Jin Hua, and Jeremy Cooper-stock. McGill reddogs. LectureNotes in Computer Science, 2377:709–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770709.htm; http:/


series/0558/papers/2377/23770709.

pdf.

Clarke:2002:R

[274] Kate Clarke, Stephen Dempster,Ian Falcao, Bronwen Jones, DanielRudolph, Alan Blair, Chris Mc-Carthy, Dariusz Walter, and NickBarnes. RoboMutts ++. Lecture



bibs/2377/23770713.htm; http:/


series/0558/papers/2377/23770713.

pdf.

Nardi:2002:PQR

[275] D. Nardi, V. Bonifaci, C. Castelpi-etra, U. Di Iorio, A. Guidotti, L. Ioc-chi, M. Salerno, and F. Zonfrilli.S.P.Q.R. legged team. Lecture Notesin Computer Science, 2377:717–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770717.htm; http:/


series/0558/papers/2377/23770717.

pdf.

Azari:2002:TDU

[276] D. Azari, J. K. Burns, K. Deshmukh,D. Fox, D. Grimes, C. T. Kwok,R. Pitkanen, A. P. Shon, and P. Tressel.Team description: UW huskies-01. Lec-ture Notes in Computer Science, 2377:721–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770721.htm; http:/


series/0558/papers/2377/23770721.

pdf.

Saffiotti:2002:TS

[277] A. Saffiotti, A. Bjorklund, S. Johans-son, and Z. Wasik. Team sweden. Lec-

REFERENCES 81



bibs/2377/23770725.htm; http:/


series/0558/papers/2377/23770725.

pdf.

Arai:2002:TDA

[278] Tamio Arai, Takeshi Fukase, RyuichiUeda, Yuichi Kobayashi, and TakanobuKawabe. The team description ofARAIBO. Lecture Notes in ComputerScience, 2377:730–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2377/23770730.



2377/23770730.pdf.

Chitta:2002:UPR

[279] Sachin Chitta, William Sacks, JimOstrowski, Aveek Das, and P. K.Mishra. The University of Pennsylva-nia RoboCup legged soccer team. Lec-ture Notes in Computer Science, 2377:734–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770734.htm; http:/


series/0558/papers/2377/23770734.

pdf.

Li:2002:WES

[280] Xiang Li, Zefeng Zhang, Lei Jiang, andXiaoping Chen. Wright Eagle 2001— Sony legged robot team. Lecture



bibs/2377/23770739.htm; http:/


series/0558/papers/2377/23770739.

pdf.

Sakushima:2002:DAD

[281] Taku Sakushima, Tetsuya Esaki,Yoshiki Asai, Nobuhiro Ito, and KoichiWada. A design of agents for the disas-ter simulator on robocup-rescue. Lec-ture Notes in Computer Science, 2377:743–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770743.htm; http:/


series/0558/papers/2377/23770743.

pdf.

Habibi:2002:AMA

[282] Jafar Habibi, Ali Nouri, and MazdaAhmadi. An approach to multi-agentcommunication used in RobocupRes-cue. Lecture Notes in Computer Sci-ence, 2377:747–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2377/23770747.



2377/23770747.pdf.

Nair:2002:TAR

[283] Ranjit Nair, Takayuki Ito, MilindTambe, and Stacy Marsella. Task al-location in the RoboCup rescue simu-

REFERENCES 82

lation domain: A short note. LectureNotes in Computer Science, 2377:751–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770751.htm; http:/


series/0558/papers/2377/23770751.

pdf.

Padgham:2002:TDR

[284] Lin Padgham, John Thangarajah,David Poutakidis, and Chandaka Fer-nando. Team description for RMIT-on-Fire: Robocup Rescue Simula-tion Team 2001. Lecture Notesin Computer Science, 2377:755–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2377/23770755.htm; http:/


series/0558/papers/2377/23770755.

pdf.

Anonymous:2002:AIaaan



papers/2377/2377indx.pdf.

Shankar:2002:CST

[286] Natarajan Shankar and Harald Rueß.Combining shostak theories. LectureNotes in Computer Science, 2378:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780001.htm; http:/


series/0558/papers/2378/23780001.

pdf.

Mitchell:2002:MRS

[287] John C. Mitchell. Multiset rewritingand security protocol analysis. LectureNotes in Computer Science, 2378:19–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780019.htm; http:/


series/0558/papers/2378/23780019.

pdf.

Baader:2002:ELC

[288] Franz Baader. Engineering of log-ics for the content-based representa-tion of information. Lecture Notesin Computer Science, 2378:23–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780023.htm; http:/


series/0558/papers/2378/23780023.

pdf.

Mellies:2002:ART

[289] Paul-Andre Mellies. Axiomatic rewrit-ing theory VI residual theory revisited.Lecture Notes in Computer Science,2378:24–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2378/23780024.htm; http:


REFERENCES 83

series/0558/papers/2378/23780024.

pdf.

Kennaway:2002:SAM

[290] Richard Kennaway, Zurab Khasi-dashvili, and Adolfo Piperno. Staticanalysis of modularity of β-reductionin the hyperbalanced λ-calculus. Lec-ture Notes in Computer Science, 2378:51–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780051.htm; http:/


series/0558/papers/2378/23780051.

pdf.

Faure:2002:ERC

[291] Germain Faure and Claude Kirchner.Exceptions in the rewriting calculus.Lecture Notes in Computer Science,2378:66–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2378/23780066.htm; http:


series/0558/papers/2378/23780066.

pdf.

Struth:2002:DFL

[292] Georg Struth. Deriving focused lat-tice calculi. Lecture Notes in ComputerScience, 2378:83–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2378/23780083.



2378/23780083.pdf.

Seki:2002:LTT

[293] Hiroyuki Seki, Toshinori Takai, YouheiFujinaka, and Yuichi Kaji. Lay-ered transducing term rewriting sys-tem and its recognizability pre-serving property. Lecture Notesin Computer Science, 2378:98–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780098.htm; http:/


series/0558/papers/2378/23780098.

pdf.

Ohsaki:2002:DCP

[294] Hitoshi Ohsaki and Toshinori Takai.Decidability and closure properties ofequational tree languages. LectureNotes in Computer Science, 2378:114–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780114.htm; http:/


series/0558/papers/2378/23780114.

pdf.

Rety:2002:RSD

[295] Pierre Rety and Julie Vuotto. Reg-ular sets of descendants by somerewrite strategies. Lecture Notesin Computer Science, 2378:129–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780129.htm; http:/


series/0558/papers/2378/23780129.

pdf.

REFERENCES 84

Waldmann:2002:RG

[296] Johannes Waldmann. Rewrite games.Lecture Notes in Computer Science,2378:144–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2378/23780144.htm; http:


series/0558/papers/2378/23780144.

pdf.

Severi:2002:EBM

[297] Paula Severi and Fer-Jan de Vries.An extensional Bohm model. LectureNotes in Computer Science, 2378:159–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780159.htm; http:/


series/0558/papers/2378/23780159.

pdf.

Forest:2002:WCE

[298] Julien Forest. A weak calculus withexplicit operators for pattern match-ing and substitution. Lecture Notesin Computer Science, 2378:174–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780174.htm; http:/


series/0558/papers/2378/23780174.

pdf.

Liang:2002:TIR

[299] Chuck Liang and Gopalan Nadathur.Tradeoffs in the intensional repre-sentation of lambda terms. Lecture



bibs/2378/23780192.htm; http:/


series/0558/papers/2378/23780192.

pdf.

Deharbe:2002:ISM

[300] David Deharbe, Anamaria MartinsMoreira, and Christophe Ringeissen.Improving symbolic model checking byrewriting temporal logic formulae. Lec-ture Notes in Computer Science, 2378:207–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780207.htm; http:/


series/0558/papers/2378/23780207.

pdf.

Voigtlander:2002:CEI

[301] Janis Voigtlander. Conditions for ef-ficiency improvement by tree trans-ducer composition. Lecture Notesin Computer Science, 2378:222–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780222.htm; http:/


series/0558/papers/2378/23780222.

pdf.

Bravenboer:2002:RSI

[302] Martin Bravenboer and Eelco Visser.Rewriting strategies for instruction se-lection. Lecture Notes in Computer

REFERENCES 85

Science, 2378:237–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2378/23780237.



2378/23780237.pdf.

Bournez:2002:PRS

[303] Olivier Bournez and Claude Kirch-ner. Probabilistic rewrite strate-gies. applications to ELAN . LectureNotes in Computer Science, 2378:252–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780252.htm; http:/


series/0558/papers/2378/23780252.

pdf.

Geser:2002:LSL

[304] Alfons Geser. Loops of superexponen-tial lengths in one-rule string rewriting.Lecture Notes in Computer Science,2378:267–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2378/23780267.htm; http:


series/0558/papers/2378/23780267.

pdf.

Tahhan-Bittar:2002:RDL

[305] Elias Tahhan-Bittar. Recursive deriva-tional length bounds for confluentterm rewrite systems. Lecture Notesin Computer Science, 2378:281–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2378/23780281.htm; http:/


series/0558/papers/2378/23780281.

pdf.

Lucas:2002:TCC

[306] Salvador Lucas. Termination of (canon-ical) context-sensitive rewriting. Lec-ture Notes in Computer Science, 2378:296–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780296.htm; http:/


series/0558/papers/2378/23780296.

pdf.

Charatonik:2002:ASC

[307] Witold Charatonik and Jean-MarcTalbot. Atomic set constraintswith projection. Lecture Notesin Computer Science, 2378:311–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780311.htm; http:/


series/0558/papers/2378/23780311.

pdf.

Levy:2002:CSO

[308] Jordi Levy and Mateu Villaret. Curry-ing second-order unification problems.Lecture Notes in Computer Science,2378:326–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2378/23780326.htm; http:

REFERENCES 86


series/0558/papers/2378/23780326.

pdf.

Dougherty:2002:DVH

[309] Dan Dougherty and Tomasz Wierzbicki.A decidable variant of higher ordermatching. Lecture Notes in ComputerScience, 2378:340–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2378/23780340.



2378/23780340.pdf.

Baader:2002:CDP

[310] Franz Baader and Cesare Tinelli. Com-bining decision procedures for positivetheories sharing constructors. LectureNotes in Computer Science, 2378:352–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780352.htm; http:/


series/0558/papers/2378/23780352.

pdf.

Pol:2002:JRS

[311] Jaco van de Pol. JITty: A rewriterwith strategy annotations. LectureNotes in Computer Science, 2378:367–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780367.htm; http:/


series/0558/papers/2378/23780367.

pdf.

Durand:2002:ATC

[312] Irene Durand. Autowrite: Atool for checking properties of termrewriting systems. Lecture Notesin Computer Science, 2378:371–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780371.htm; http:/


series/0558/papers/2378/23780371.

pdf.

Lecland:2002:TIT

[313] Benoit Lecland and Pierre Rety.TTSLI: An implementation of tree-tuple synchronized languages. LectureNotes in Computer Science, 2378:376–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780376.htm; http:/


series/0558/papers/2378/23780376.

pdf.

Lippi:2002:GII

[314] Sylvain Lippi. in2 : A graphical in-terpreter for interaction nets. LectureNotes in Computer Science, 2378:380–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2378/23780380.htm; http:/


series/0558/papers/2378/23780380.

pdf.

REFERENCES 87

Anonymous:2002:AIaaao




Geyer:2002:IVA

[316] Lars Geyer and Martin Becker.On the influence of variabilitieson the application-engineering pro-cess of a product family. LectureNotes in Computer Science, 2379:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790001.htm; http:/


series/0558/papers/2379/23790001.

pdf.

Jaring:2002:RVS

[317] Michel Jaring and Jan Bosch. Rep-resenting variability in software prod-uct lines: A case study. LectureNotes in Computer Science, 2379:15–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790015.htm; http:/


series/0558/papers/2379/23790015.

pdf.

Krueger:2002:VMS

[318] Charles W. Krueger. Variation man-agement for software production lines.Lecture Notes in Computer Science,



0558/bibs/2379/23790037.htm; http:


series/0558/papers/2379/23790037.

pdf.

Bockle:2002:AIP

[319] Gunter Bockle, Jesus Bermejo Munoz,Peter Knauber, Charles W. Krueger,Julio Cesar Sampaio do Prado Leite,Frank van der Linden, Linda Northrop,Michael Stark, and David M. Weiss.Adopting and institutionalizing a prod-uct line culture. Lecture Notesin Computer Science, 2379:49–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790049.htm; http:/


series/0558/papers/2379/23790049.

pdf.

Voget:2002:ESP

[320] Stefan Voget and Martin Becker. Es-tablishing a software product linein an immature domain. LectureNotes in Computer Science, 2379:60–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790060.htm; http:/


series/0558/papers/2379/23790060.

pdf.

Wijnstra:2002:CFS

[321] Jan Gerben Wijnstra. Critical fac-

REFERENCES 88

tors for a successful platform-basedproduct family approach. LectureNotes in Computer Science, 2379:68–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790068.htm; http:/


series/0558/papers/2379/23790068.

pdf.

Zyl:2002:PLA

[322] Jay van Zyl. Product line architectureand the separation of concerns. Lec-ture Notes in Computer Science, 2379:90–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790090.htm; http:/


series/0558/papers/2379/23790090.

pdf.

Muthig:2002:MDP

[323] Dirk Muthig and Colin Atkinson.Model-driven product line architec-tures. Lecture Notes in ComputerScience, 2379:110–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2379/23790110.



2379/23790110.pdf.

Thiel:2002:SIV

[324] Steffen Thiel and Andreas Hein. Sys-tematic integration of variability intoproduct line architecture design. Lec-ture Notes in Computer Science, 2379:



bibs/2379/23790130.htm; http:/


series/0558/papers/2379/23790130.

pdf.

Brown:2002:ACS

[325] T. John Brown, Ivor Spence, Pe-ter Kilpatrick, and Danny Crookes.Adaptable components for softwareproduct line engineering. LectureNotes in Computer Science, 2379:154–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790154.htm; http:/


series/0558/papers/2379/23790154.

pdf.

Mannion:2002:UFO

[326] Mike Mannion. Using first-order logicfor product line model validation. Lec-ture Notes in Computer Science, 2379:176–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790176.htm; http:/


series/0558/papers/2379/23790176.

pdf.

Pree:2002:PLA

[327] Wolfgang Pree, Marcus Fontoura, andBernhard Rumpe. Product line anno-tations with UML-F. Lecture Notesin Computer Science, 2379:188–??,2002. CODEN LNCSD9. ISSN

REFERENCES 89



bibs/2379/23790188.htm; http:/


series/0558/papers/2379/23790188.

pdf.

Fey:2002:FMM

[328] Daniel Fey, Robert Fajta, andAndras Boros. Feature modeling:A meta-model to enhance usabil-ity and usefulness. Lecture Notesin Computer Science, 2379:198–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790198.htm; http:/


series/0558/papers/2379/23790198.

pdf.

Deursen:2002:FBP

[329] Arie van Deursen, Merijn de Jonge,and Tobias Kuipers. Feature-based product line instantiation us-ing source-level packages. LectureNotes in Computer Science, 2379:217–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790217.htm; http:/


series/0558/papers/2379/23790217.

pdf.

Ferber:2002:FID

[330] Stefan Ferber, Jurgen Haag, andJuha Savolainen. Feature inter-action and dependencies: Mod-eling features for reengineering a

legacy product line. Lecture Notesin Computer Science, 2379:235–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790235.htm; http:/


series/0558/papers/2379/23790235.

pdf.

Bosch:2002:MES

[331] Jan Bosch. Maturity and evolution insoftware product lines: Approaches,artefacts and organization. LectureNotes in Computer Science, 2379:257–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790257.htm; http:/


series/0558/papers/2379/23790257.

pdf.

Simon:2002:EIS

[332] Daniel Simon and Thomas Eisen-barth. Evolutionary introduction ofsoftware product lines. Lecture Notesin Computer Science, 2379:272–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790272.htm; http:/


series/0558/papers/2379/23790272.

pdf.

Jolley:2002:GPI

[333] Truman M. Jolley, David J. Kasik, andConrad E. Kimball. Governance po-larities of internal product lines. Lec-

REFERENCES 90



bibs/2379/23790284.htm; http:/


series/0558/papers/2379/23790284.

pdf.

Yacoub:2002:PAC

[334] Sherif Yacoub. Performance analysisof component-based applications. Lec-ture Notes in Computer Science, 2379:299–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790299.htm; http:/


series/0558/papers/2379/23790299.

pdf.

Smith:2002:UOA

[335] Dennis Smith, Liam O’ Brien, and JohnBergey. Using the options analysis forreengineering (OAR) method for min-ing components for a product line. Lec-ture Notes in Computer Science, 2379:316–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790316.htm; http:/


series/0558/papers/2379/23790316.

pdf.

Ommering:2002:WSS

[336] Rob van Ommering and Jan Bosch.Widening the scope of softwareproduct lines — from variationto composition. Lecture Notes



bibs/2379/23790328.htm; http:/


series/0558/papers/2379/23790328.

pdf.

Kishi:2002:MPL

[337] Tomoji Kishi, Natsuko Noda, andTakuya Katayama. A method for prod-uct line scoping based on a decision-making framework. Lecture Notesin Computer Science, 2379:348–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790348.htm; http:/


series/0558/papers/2379/23790348.

pdf.

Kang:2002:UMP

[338] Kyo C. Kang, Patrick Donohoe, Eu-nman Koh, Jaejoon Lee, and Kwan-woo Lee. Using a marketing and prod-uct plan as a key driver for prod-uct line asset development. LectureNotes in Computer Science, 2379:366–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790366.htm; http:/


series/0558/papers/2379/23790366.

pdf.

Linden:2002:ESA

[339] Frank van der Linden. Engineer-

REFERENCES 91

ing software architectures, processesand platforms for system families— ESAPS overview. Lecture Notesin Computer Science, 2379:383–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2379/23790383.htm; http:/


series/0558/papers/2379/23790383.

pdf.

Anonymous:2002:AIaaap




Reif:2002:MAC

[341] John H. Reif. Molecular assemblyand computation: From theory to ex-perimental demonstrations. LectureNotes in Computer Science, 2380:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800001.htm; http:/


series/0558/papers/2380/23800001.

pdf.

Marathe:2002:TPC

[342] Madhav V. Marathe. Towardsa predictive computational com-plexity theory. Lecture Notesin Computer Science, 2380:22–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2380/23800022.htm; http:/


series/0558/papers/2380/23800022.

pdf.

Pitts:2002:ESS

[343] Andrew M. Pitts. Equivariant syn-tax and semantics. Lecture Notesin Computer Science, 2380:32–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800032.htm; http:/


series/0558/papers/2380/23800032.

pdf.

Lungo:2002:DTR

[344] Alberto Del Lungo, Andrea Frosini,Maurice Nivat, and Laurent Vuillon.Discrete tomography: Reconstructionunder periodicity constraints. LectureNotes in Computer Science, 2380:38–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800038.htm; http:/


series/0558/papers/2380/23800038.

pdf.

Mannila:2002:LGM

[345] Heikki Mannila. Local and globalmethods in data mining: Basic tech-niques and open problems. LectureNotes in Computer Science, 2380:57–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 92


bibs/2380/23800057.htm; http:/


series/0558/papers/2380/23800057.

pdf.

Hermenegildo:2002:PDV

[346] M. Hermenegildo, G. Puebla, F. Bueno,and P. Lopez-Garcıa. Program de-bugging and validation using se-mantic approximations and par-tial specifications. Lecture Notesin Computer Science, 2380:69–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800069.htm; http:/


series/0558/papers/2380/23800069.

pdf.

Engebretsen:2002:IRE

[347] Lars Engebretsen, Jonas Holmerin,and Alexander Russell. Inap-proximability results for equationsover finite groups. Lecture Notesin Computer Science, 2380:73–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800073.htm; http:/


series/0558/papers/2380/23800073.

pdf.

Pettie:2002:FAP

[348] Seth Pettie. A faster all-pairsshortest path algorithm for real-weighted sparse graphs. LectureNotes in Computer Science, 2380:85–??, 2002. CODEN LNCSD9. ISSN



bibs/2380/23800085.htm; http:/


series/0558/papers/2380/23800085.

pdf.

Colcombet:2002:FGH

[349] Thomas Colcombet. On families ofgraphs having a decidable first or-der theory with reachability. LectureNotes in Computer Science, 2380:98–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800098.htm; http:/


series/0558/papers/2380/23800098.

pdf.

Fabrikant:2002:HOT

[350] Alex Fabrikant, Elias Koutsoupias, andChristos H. Papadimitriou. Heuris-tically optimized trade-offs: A newparadigm for power laws in the In-ternet. Lecture Notes in ComputerScience, 2380:110–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2380/23800110.



2380/23800110.pdf.

Fotakis:2002:SCN

[351] Dimitris Fotakis, Spyros Kontogiannis,Elias Koutsoupias, Marios Mavroni-colas, and Paul Spirakis. The struc-ture and complexity of Nash equilib-ria for a selfish routing game. Lecture

REFERENCES 93



bibs/2380/23800123.htm; http:/


series/0558/papers/2380/23800123.

pdf.

Khanna:2002:CMA

[352] Sanjeev Khanna, Joseph (Seffi) Naor,and Dan Raz. Control mes-sage aggregation in group commu-nication protocols. Lecture Notesin Computer Science, 2380:135–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800135.htm; http:/


series/0558/papers/2380/23800135.

pdf.

Jurdzinski:2002:CRL

[353] Tomasz Jurdzinski and Krzysztof Lo-rys. Church–Rosser languages vs.UCFL. Lecture Notes in ComputerScience, 2380:147–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2380/23800147.



2380/23800147.pdf.

Bala:2002:IRL

[354] Sebastian Bala. Intersection of regu-lar languages and star hierarchy. Lec-ture Notes in Computer Science, 2380:159–??, 2002. CODEN LNCSD9. ISSN



bibs/2380/23800159.htm; http:/


series/0558/papers/2380/23800159.

pdf.

Lombardy:2002:CRA

[355] Sylvain Lombardy. On the construc-tion of reversible automata for re-versible languages. Lecture Notesin Computer Science, 2380:170–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800170.htm; http:/


series/0558/papers/2380/23800170.

pdf.

Elmasry:2002:PQP

[356] Amr Elmasry. Priority queues, pair-ing, and adaptive sorting. LectureNotes in Computer Science, 2380:183–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800183.htm; http:/


series/0558/papers/2380/23800183.

pdf.

Bender:2002:ESE

[357] Michael A. Bender, Richard Cole,and Rajeev Raman. Exponen-tial structures for efficient cache-oblivious algorithms. Lecture Notesin Computer Science, 2380:195–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 94



bibs/2380/23800195.htm; http:/


series/0558/papers/2380/23800195.

pdf.

Impagliazzo:2002:BDF

[358] Russell Impagliazzo and NathanSegerlind. Bounded-depth Frege sys-tems with counting axioms polyno-mially simulate Nullstellensatz refu-tations. Lecture Notes in ComputerScience, 2380:208–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2380/23800208.



2380/23800208.pdf.

Esteban:2002:CRB

[359] Juan Luis Esteban, Nicola Galesi, andJochen Messner. On the complexity ofresolution with bounded conjunctions.Lecture Notes in Computer Science,2380:220–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2380/23800220.htm; http:


series/0558/papers/2380/23800220.

pdf.

Kiayias:2002:CHB

[360] Aggelos Kiayias and Moti Yung. Cryp-tographic hardness based on the de-coding of Reed–Solomon codes. Lec-ture Notes in Computer Science, 2380:232–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2380/23800232.htm; http:/


series/0558/papers/2380/23800232.

pdf.

Ishai:2002:PCR

[361] Yuval Ishai and Eyal Kushilevitz. Per-fect constant-round secure computa-tion via perfect randomizing polyno-mials. Lecture Notes in ComputerScience, 2380:244–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2380/23800244.



2380/23800244.pdf.

Grigoriev:2002:ELB

[362] Dima Grigoriev, Edward A. Hirsch,and Dmitrii V. Pasechnik. Expo-nential lower bound for static semi-algebraic proofs. Lecture Notesin Computer Science, 2380:257–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800257.htm; http:/


series/0558/papers/2380/23800257.

pdf.

Jakoby:2002:PPS

[363] Andreas Jakoby and Maciej Liskiewicz.Paths problems in symmetric log-arithmic space. Lecture Notesin Computer Science, 2380:269–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 95



bibs/2380/23800269.htm; http:/


series/0558/papers/2380/23800269.

pdf.

Damaschke:2002:SSP

[364] Peter Damaschke. Scheduling searchprocedures. Lecture Notes in ComputerScience, 2380:281–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2380/23800281.



2380/23800281.pdf.

Iwama:2002:ROK

[365] Kazuo Iwama and Shiro Take-tomi. Removable online knap-sack problems. Lecture Notesin Computer Science, 2380:293–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800293.htm; http:/


series/0558/papers/2380/23800293.

pdf.

Epstein:2002:NBV

[366] Leah Epstein, Steve Seiden, and Robvan Stee. New bounds for variable-sized and resource augmented on-line bin packing. Lecture Notesin Computer Science, 2380:306–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800306.htm; http:/


series/0558/papers/2380/23800306.

pdf.

Ollinger:2002:QSU

[367] Nicolas Ollinger. The quest for smalluniversal cellular automata. LectureNotes in Computer Science, 2380:318–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800318.htm; http:/


series/0558/papers/2380/23800318.

pdf.

Papazian:2002:HRG

[368] Christophe Papazian and Eric Remila.Hyperbolic recognition by graph au-tomata. Lecture Notes in ComputerScience, 2380:330–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2380/23800330.



2380/23800330.pdf.

Ablayev:2002:QSB

[369] Farid Ablayev, Cristopher Moore,and Christopher Pollett. Quantumand stochastic branching programsof bounded width. Lecture Notesin Computer Science, 2380:343–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800343.htm; http:/


REFERENCES 96

series/0558/papers/2380/23800343.

pdf.

Gargano:2002:STB

[370] Luisa Gargano, Pavol Hell, LadislavStacho, and Ugo Vaccaro. Span-ning trees with bounded numberof branch vertices. Lecture Notesin Computer Science, 2380:355–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800355.htm; http:/


series/0558/papers/2380/23800355.

pdf.

Beier:2002:EOR

[371] Rene Beier, Peter Sanders, and NaveenSivadasan. Energy optimal rout-ing in radio networks using geomet-ric data structures. Lecture Notesin Computer Science, 2380:366–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800366.htm; http:/


series/0558/papers/2380/23800366.

pdf.

Christersson:2002:GBS

[372] Malin Christersson, Leszek Gasie-niec, and Andrzej Lingas. Gossip-ing with bounded size messages in adhoc radio networks. Lecture Notesin Computer Science, 2380:377–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800377.htm; http:/


series/0558/papers/2380/23800377.

pdf.

Merkle:2002:KLS

[373] Wolfgang Merkle. The Kolmogorov–Loveland stochastic sequences are notclosed under selecting subsequences.Lecture Notes in Computer Science,2380:390–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2380/23800390.htm; http:


series/0558/papers/2380/23800390.

pdf.

Hearn:2002:NCL

[374] Robert A. Hearn and Erik D. De-maine. The nondeterministic con-straint logic model of computation:Reductions and applications. LectureNotes in Computer Science, 2380:401–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800401.htm; http:/


series/0558/papers/2380/23800401.

pdf.

Dalmau:2002:CSP

[375] Vıctor Dalmau. Constraint satis-faction problems in non-deterministiclogarithmic space. Lecture Notesin Computer Science, 2380:414–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 97

bibs/2380/23800414.htm; http:/


series/0558/papers/2380/23800414.

pdf.

Brodal:2002:COD

[376] Gerth Stølting Brodal and RolfFagerberg. Cache oblivious dis-tribution sweeping. Lecture Notesin Computer Science, 2380:426–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800426.htm; http:/


series/0558/papers/2380/23800426.

pdf.

Ostlin:2002:OPS

[377] Anna Ostlin and Rasmus Pagh.One-probe search. Lecture Notesin Computer Science, 2380:439–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800439.htm; http:/


series/0558/papers/2380/23800439.

pdf.

Charikar:2002:NAS

[378] Moses Charikar, Piotr Indyk, and RinaPanigrahy. New algorithms for subsetquery, partial match, orthogonal rangesearching, and related problems. Lec-ture Notes in Computer Science, 2380:451–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800451.htm; http:/


series/0558/papers/2380/23800451.

pdf.

Martin:2002:MPP

[379] Keye Martin, Michael Mislove, andJames Worrell. Measuring the prob-abilistic powerdomain. Lecture Notesin Computer Science, 2380:463–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800463.htm; http:/


series/0558/papers/2380/23800463.

pdf.

Ong:2002:GCL

[380] C.-H. L. Ong and P. Di Gi-anantonio. Games characterizingLevy–Longo trees. Lecture Notesin Computer Science, 2380:476–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800476.htm; http:/


series/0558/papers/2380/23800476.

pdf.

Bauer:2002:CFP

[381] Andrej Bauer, Martın Hotzel Es-cardo, and Alex Simpson. Com-paring functional paradigms for ex-act real-number computation. LectureNotes in Computer Science, 2380:488–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800488.htm; http:/

REFERENCES 98


series/0558/papers/2380/23800488.

pdf.

Duchon:2002:RSB

[382] Philippe Duchon, Philippe Flajolet,Guy Louchard, and Gilles Schaef-fer. Random sampling from Boltz-mann principles. Lecture Notesin Computer Science, 2380:501–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800501.htm; http:/


series/0558/papers/2380/23800501.

pdf.

Duch:2002:APO

[383] Amalia Duch and Conrado Martınez.On the average performance of or-thogonal range search in multidimen-sional data structures. Lecture Notesin Computer Science, 2380:514–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800514.htm; http:/


series/0558/papers/2380/23800514.

pdf.

Kick:2002:BMT

[384] Marco Kick. Bialgebraic modellingof timed processes. Lecture Notesin Computer Science, 2380:525–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800525.htm; http:/


series/0558/papers/2380/23800525.

pdf.

Breugel:2002:TLM

[385] Franck van Breugel, Steven Shalit,and James Worrell. Testing labelledMarkov processes. Lecture Notesin Computer Science, 2380:537–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800537.htm; http:/


series/0558/papers/2380/23800537.

pdf.

Hitchcock:2002:WCC

[386] John M. Hitchcock and Jack H. Lutz.Why computational complexity re-quires stricter martingales. LectureNotes in Computer Science, 2380:549–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800549.htm; http:/


series/0558/papers/2380/23800549.

pdf.

Hitchcock:2002:CPE

[387] John M. Hitchcock. Correspondenceprinciples for effective dimensions. Lec-ture Notes in Computer Science, 2380:561–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800561.htm; http:/


REFERENCES 99

series/0558/papers/2380/23800561.

pdf.

Meseguer:2002:TAP

[388] Jose Meseguer and Grigore Rosu.A total approach to partial alge-braic specification. Lecture Notesin Computer Science, 2380:572–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800572.htm; http:/


series/0558/papers/2380/23800572.

pdf.

Lohrey:2002:AD

[389] Markus Lohrey, Pedro R. D’Argenio,and Holger Hermanns. Axioma-tising divergence. Lecture Notesin Computer Science, 2380:585–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800585.htm; http:/


series/0558/papers/2380/23800585.

pdf.

Cardelli:2002:SLQ

[390] Luca Cardelli, Philippa Gardner, andGiorgio Ghelli. A spatial logicfor querying graphs. Lecture Notesin Computer Science, 2380:597–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800597.htm; http:/


series/0558/papers/2380/23800597.

pdf.

Radzik:2002:ITB

[391] Tomasz Radzik. Improving timebounds on maximum generalised flowcomputations by contracting the net-work. Lecture Notes in ComputerScience, 2380:611–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2380/23800611.



2380/23800611.pdf.

Berman:2002:AHB

[392] Piotr Berman and Marek Karpin-ski. Approximation hardness ofbounded degree MIN-CSP and MIN-BISECTION. Lecture Notes in Com-puter Science, 2380:623–??, 2002. CO-DEN LNCSD9. ISSN 0302-9743(print), 1611-3349 (electronic). URLhttp://link.springer-ny.com/link/

service/series/0558/bibs/2380/23800623.



2380/23800623.pdf.

Demetrescu:2002:IBN

[393] Camil Demetrescu and Giuseppe F.Italiano. Improved bounds andnew trade-offs for dynamic all pairsshortest paths. Lecture Notesin Computer Science, 2380:633–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800633.htm; http:/


REFERENCES 100

series/0558/papers/2380/23800633.

pdf.

Henzinger:2002:SUS

[394] Thomas A. Henzinger, Sriram C. Kr-ishnan, Orna Kupferman, and FreddyY. C. Mang. Synthesis of unini-tialized systems. Lecture Notesin Computer Science, 2380:644–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800644.htm; http:/


series/0558/papers/2380/23800644.

pdf.

Genest:2002:ISH

[395] Blaise Genest, Anca Muscholl, Hel-mut Seidl, and Marc Zeitoun. Infinite-state high-level MSCs: Model-checkingand realizability. Lecture Notesin Computer Science, 2380:657–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800657.htm; http:/


series/0558/papers/2380/23800657.

pdf.

Senizergues:2002:BDR

[396] Geraud Senizergues. L(A) = L(B)?decidability results from completeformal systems. Lecture Notesin Computer Science, 2380:37–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800037.htm; http:/


series/0558/papers/2380/23800037.

pdf. Godel Prize 2002.

Wich:2002:UIC

[397] Klaus Wich. Universal inher-ence of cycle-free context-free am-biguity functions. Lecture Notesin Computer Science, 2380:669–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800669.htm; http:/


series/0558/papers/2380/23800669.

pdf.

Guha:2002:HDS

[398] Sudipto Guha, Piotr Indyk, S. Muthukr-ishnan, and Martin J. Strauss. His-togramming data streams with fastper-item processing. Lecture Notesin Computer Science, 2380:681–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800681.htm; http:/


series/0558/papers/2380/23800681.

pdf.

Charikar:2002:FFI

[399] Moses Charikar, Kevin Chen, andMartin Farach-Colton. Finding fre-quent items in data streams. LectureNotes in Computer Science, 2380:693–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800693.htm; http:/

REFERENCES 101


series/0558/papers/2380/23800693.

pdf.

Cachat:2002:SSS

[400] Thierry Cachat. Symbolic strategy syn-thesis for games on pushdown graphs.Lecture Notes in Computer Science,2380:704–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2380/23800704.htm; http:


series/0558/papers/2380/23800704.

pdf.

Srba:2002:SBR

[401] Jirı Srba. Strong bisimilarity andregularity of basic process algebrais PSPACE-hard. Lecture Notesin Computer Science, 2380:716–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800716.htm; http:/


series/0558/papers/2380/23800716.

pdf.

Brodal:2002:SSS

[402] Gerth Stølting Brodal, Rune B.Lyngsø, Anna Ostlin, and Chris-tian N. S. Pedersen. Solvingthe string statistics problem intime O(\ log \). Lecture Notesin Computer Science, 2380:728–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800728.htm; http:/


series/0558/papers/2380/23800728.

pdf.

Deng:2002:PDS

[403] Xiaotie Deng, Guojun Li, Zimao Li,Bin Ma, and Lusheng Wang. A PTASfor distinguishing (sub)string selection.Lecture Notes in Computer Science,2380:740–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2380/23800740.htm; http:


series/0558/papers/2380/23800740.

pdf.

Kuske:2002:TOS

[404] Dietrich Kuske and Markus Lohrey.On the theory of one-step rewrit-ing in trace monoids. Lecture Notesin Computer Science, 2380:752–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800752.htm; http:/


series/0558/papers/2380/23800752.

pdf.

Bielecki:2002:NB

[405] Micha l Bielecki, Jan Hidders, JanParedaens, Jerzy Tyszkiewicz, andJan Van den Bussche. Navigat-ing with a browser. Lecture Notesin Computer Science, 2380:764–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800764.htm; http:/

REFERENCES 102


series/0558/papers/2380/23800764.

pdf.

Kumar:2002:IRS

[406] V. S. Anil Kumar and Madhav V.Marathe. Improved results for Stack-elberg scheduling strategies. LectureNotes in Computer Science, 2380:776–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800776.htm; http:/


series/0558/papers/2380/23800776.

pdf.

Adamy:2002:CCR

[407] Udo Adamy, Christoph Ambuehl,R. Sai Anand, and Thomas Erlebach.Call control in rings. Lecture Notesin Computer Science, 2380:788–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800788.htm; http:/


series/0558/papers/2380/23800788.

pdf.

Chrobak:2002:PSO

[408] Marek Chrobak, Leah Epstein, JohnNoga, Jirı Sgall, Rob van Stee,Tomas Tichy, and Nodari Vakha-nia. Preemptive scheduling in over-loaded systems. Lecture Notesin Computer Science, 2380:800–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800800.htm; http:/


series/0558/papers/2380/23800800.

pdf.

Karhumaki:2002:EPF

[409] J. Karhumaki and L. P. Lisovik. Theequivalence problem of finite substitu-tions on ab∗ c, with applications. Lec-ture Notes in Computer Science, 2380:812–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800812.htm; http:/


series/0558/papers/2380/23800812.

pdf.

Stirling:2002:DDE

[410] Colin Stirling. Deciding DPDA equiv-alence is primitive recursive. LectureNotes in Computer Science, 2380:821–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800821.htm; http:/


series/0558/papers/2380/23800821.

pdf.

Bojanczyk:2002:TWA

[411] Miko laj Bojanczyk. Two-way alternat-ing automata and finite models. Lec-ture Notes in Computer Science, 2380:833–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800833.htm; http:/


REFERENCES 103

series/0558/papers/2380/23800833.

pdf.

Berman:2002:AHC

[412] Piotr Berman, Marek Karpinski, andYakov Nekrich. Approximating Huff-man codes in parallel. Lecture Notesin Computer Science, 2380:845–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800845.htm; http:/


series/0558/papers/2380/23800845.

pdf.

Fantozzi:2002:SIP

[413] Carlo Fantozzi, Andrea Pietracap-rina, and Geppino Pucci. Seam-less integration of parallelism andmemory hierarchy. Lecture Notesin Computer Science, 2380:856–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800856.htm; http:/


series/0558/papers/2380/23800856.

pdf.

Nisan:2002:CCA

[414] Noam Nisan. The communicationcomplexity of approximate set pack-ing and covering. Lecture Notesin Computer Science, 2380:868–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800868.htm; http:/


series/0558/papers/2380/23800868.

pdf.

Doerr:2002:AWG

[415] Benjamin Doerr. Antirandomizingthe wrong game. Lecture Notesin Computer Science, 2380:876–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800876.htm; http:/


series/0558/papers/2380/23800876.

pdf.

Akcoglu:2002:FUI

[416] Karhan Akcoglu, Petros Drineas, andMing-Yang Kao. Fast universaliza-tion of investment strategies with prov-ably good relative returns. LectureNotes in Computer Science, 2380:888–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800888.htm; http:/


series/0558/papers/2380/23800888.

pdf.

Adler:2002:RPE

[417] Micah Adler, Harald Racke, NaveenSivadasan, Christian Sohler, andBerthold Vocking. Randomizedpursuit-evasion in graphs. LectureNotes in Computer Science, 2380:901–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800901.htm; http:/


REFERENCES 104

series/0558/papers/2380/23800901.

pdf.

Wells:2002:EPT

[418] J. B. Wells. The essence ofprincipal typings. Lecture Notesin Computer Science, 2380:913–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800913.htm; http:/


series/0558/papers/2380/23800913.

pdf.

Adsul:2002:CTL

[419] Bharat Adsul and Milind Sohoni. Com-plete and tractable local linear timetemporal logics over traces. LectureNotes in Computer Science, 2380:926–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800926.htm; http:/


series/0558/papers/2380/23800926.

pdf.

Gastin:2002:EEC

[420] Paul Gastin and Madhavan Mukund.An elementary expressively completetemporal logic for Mazurkiewicz traces.Lecture Notes in Computer Science,2380:938–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2380/23800938.htm; http:


series/0558/papers/2380/23800938.

pdf.

Brattka:2002:RNI

[421] Vasco Brattka. Random numbers andan incomplete immune recursive set.Lecture Notes in Computer Science,2380:950–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2380/23800950.htm; http:


series/0558/papers/2380/23800950.

pdf.

Hertling:2002:BMC

[422] Peter Hertling. A Banach-Mazur com-putable but not Markov computablefunction on the computable real num-bers. Lecture Notes in Computer Sci-ence, 2380:962–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2380/23800962.



2380/23800962.pdf.

Czumaj:2002:PTA

[423] Artur Czumaj, Andrzej Lingas,and Hairong Zhao. Polynomial-time approximation schemes forthe Euclidean survivable networkdesign problem. Lecture Notesin Computer Science, 2380:973–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800973.htm; http:/


series/0558/papers/2380/23800973.

pdf.

REFERENCES 105

Bjorklund:2002:FPS

[424] Andreas Bjorklund and Thore Hus-feldt. Finding a path of super-logarithmic length. Lecture Notesin Computer Science, 2380:985–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800985.htm; http:/


series/0558/papers/2380/23800985.

pdf.

Uehara:2002:LTA

[425] Ryuhei Uehara. Linear time al-gorithms on chordal bipartite andstrongly chordal graphs. LectureNotes in Computer Science, 2380:993–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23800993.htm; http:/


series/0558/papers/2380/23800993.

pdf.

Holmerin:2002:IIR

[426] Jonas Holmerin. Improved inapprox-imability results for vertex cover on k-uniform hypergraphs. Lecture Notesin Computer Science, 2380:1005–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23801005.htm; http:/


series/0558/papers/2380/23801005.

pdf.

Kohayakawa:2002:ETH

[427] Yoshiharu Kohayakawa, Brendan Na-gle, and Vojtech Rodl. Efficient test-ing of hypergraphs. Lecture Notesin Computer Science, 2380:1017–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23801017.htm; http:/


series/0558/papers/2380/23801017.

pdf.

Wu:2002:ONS

[428] Xiaodong Wu and Danny Z. Chen.Optimal net surface problems withapplications. Lecture Notes inComputer Science, 2380:1029–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23801029.htm; http:/


series/0558/papers/2380/23801029.

pdf.

Bonichon:2002:WTR

[429] Nicolas Bonichon, Bertrand Le Saec,and Mohamed Mosbah. Wagner’stheorem on realizers. Lecture Notesin Computer Science, 2380:1043–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23801043.htm; http:/


series/0558/papers/2380/23801043.

pdf.

REFERENCES 106

Liberatore:2002:CA

[430] Vincenzo Liberatore. Circular ar-rangements. Lecture Notes inComputer Science, 2380:1054–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2380/23801054.htm; http:/


series/0558/papers/2380/23801054.

pdf.

Anonymous:2002:AIaaaq




Baaz:2002:PARa

[432] Matthias Baaz. Proof analy-sis by resolution. Lecture Notesin Computer Science, 2381:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810001.htm; http:/


series/0558/papers/2381/23810001.

pdf.

Miller:2002:ULL

[433] Dale Miller and Elaine Pimentel.Using linear logic to reason aboutsequent systems. Lecture Notesin Computer Science, 2381:2–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2381/23810002.htm; http:/


series/0558/papers/2381/23810002.

pdf.

Baaz:2002:STS

[434] Matthias Baaz and Agata Ciabattoni.A schutte-tait style cut-eliminationproof for first-order Godel logic. Lec-ture Notes in Computer Science, 2381:24–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810024.htm; http:/


series/0558/papers/2381/23810024.

pdf.

Blackburn:2002:TQH

[435] Patrick Blackburn and Maarten Marx.Tableaux for quantified hybrid logic.Lecture Notes in Computer Science,2381:38–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2381/23810038.htm; http:


series/0558/papers/2381/23810038.

pdf.

Chetcuti-Sperandio:2002:TBA

[436] Nathalie Chetcuti-Sperandio. Tableau-based automated deduction for du-ration calculus. Lecture Notesin Computer Science, 2381:53–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 107

bibs/2381/23810053.htm; http:/


series/0558/papers/2381/23810053.

pdf.

Mayer:2002:LTL

[437] Marta Cialdea Mayer and Carla Limon-gelli. Linear time logic, condi-tioned models, and planning with in-complete knowledge. Lecture Notesin Computer Science, 2381:70–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810070.htm; http:/


series/0558/papers/2381/23810070.

pdf.

Degtyarev:2002:SCR

[438] Anatoli Degtyarev, Michael Fisher, andBoris Konev. A simplified clausalresolution procedure for propositionallinear-time temporal logic. LectureNotes in Computer Science, 2381:85–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810085.htm; http:/


series/0558/papers/2381/23810085.

pdf.

Eiter:2002:MNL

[439] Thomas Eiter, Volker Klotz, HansTompits, and Stefan Woltran. Modalnonmonotonic logics revisited: Effi-cient encodings for the basic reason-ing tasks. Lecture Notes in ComputerScience, 2381:100–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),

1611-3349 (electronic). URL http://


series/0558/bibs/2381/23810100.



2381/23810100.pdf.

Ferrari:2002:TCL

[440] Mauro Ferrari, Camillo Fiorentini, andGuido Fiorino. Tableau calculi for thelogics of finite k-ary trees. LectureNotes in Computer Science, 2381:115–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810115.htm; http:/


series/0558/papers/2381/23810115.

pdf.

Giese:2002:MGS

[441] Martin Giese. A model generationstyle completeness proof for constrainttableaux with superposition. LectureNotes in Computer Science, 2381:130–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810130.htm; http:/


series/0558/papers/2381/23810130.

pdf.

Hladik:2002:IOT

[442] Jan Hladik. Implementation andoptimisation of a tableau algorithmfor the guarded fragment. LectureNotes in Computer Science, 2381:145–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 108


bibs/2381/23810145.htm; http:/


series/0558/papers/2381/23810145.

pdf.

Letz:2002:LMC

[443] Reinhold Letz. Lemma and modelcaching in decision procedures forquantified Boolean formulas. LectureNotes in Computer Science, 2381:160–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810160.htm; http:/


series/0558/papers/2381/23810160.

pdf.

Letz:2002:IER

[444] Reinhold Letz and Gernot Stenz. In-tegration of equality reasoning intothe disconnection calculus. LectureNotes in Computer Science, 2381:176–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810176.htm; http:/


series/0558/papers/2381/23810176.

pdf.

Metcalfe:2002:ASC

[445] George Metcalfe, Nicola Olivetti, andDov Gabbay. Analytic sequent cal-culi for Abelian and Lukasiewicz logics.Lecture Notes in Computer Science,2381:191–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2381/23810191.htm; http:


series/0558/papers/2381/23810191.

pdf.

Nguyen:2002:ATS

[446] Linh Anh Nguyen. Analytic tableausystems for propositional bimodal log-ics of knowledge and belief. LectureNotes in Computer Science, 2381:206–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810206.htm; http:/


series/0558/papers/2381/23810206.

pdf.

Petermann:2002:CTC

[447] Uwe Petermann. A confluent theoryconnection calculus. Lecture Notesin Computer Science, 2381:221–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810221.htm; http:/


series/0558/papers/2381/23810221.

pdf.

Sofronie-Stokkermans:2002:UWP

[448] Viorica Sofronie-Stokkermans. On uni-form word problems involving bridgingoperators on distributive lattices. Lec-ture Notes in Computer Science, 2381:235–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810235.htm; http:/


REFERENCES 109

series/0558/papers/2381/23810235.

pdf.

Cate:2002:QAP

[449] Balder ten Cate and Chung chiehShan. Question answering: Frompartitions to prolog. Lecture Notesin Computer Science, 2381:251–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810251.htm; http:/


series/0558/papers/2381/23810251.

pdf.

Thion:2002:GTP

[450] V. Thion, S. Cerrito, and Marta CialdeaMayer. A general theorem proverfor quantified modal logics. LectureNotes in Computer Science, 2381:266–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810266.htm; http:/


series/0558/papers/2381/23810266.

pdf.

Willard:2002:SNE

[451] Dan E. Willard. Some new exceptionsfor the semantic tableaux version of thesecond incompleteness theorem. Lec-ture Notes in Computer Science, 2381:281–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810281.htm; http:/


series/0558/papers/2381/23810281.

pdf.

Wirth:2002:NIS

[452] Claus-Peter Wirth. A new indefinitesemantics for Hilbert’s epsilon. Lec-ture Notes in Computer Science, 2381:298–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810298.htm; http:/


series/0558/papers/2381/23810298.

pdf.

Zarba:2002:TCC

[453] Calogero G. Zarba. A tableau calcu-lus for combining non-disjoint theories.Lecture Notes in Computer Science,2381:315–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2381/23810315.htm; http:


series/0558/papers/2381/23810315.

pdf.

Habert:2002:LPE

[454] L. Habert, J.-M. Notin, and D. Galmiche.LINK: A proof environment basedon proof nets. Lecture Notesin Computer Science, 2381:330–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810330.htm; http:/


series/0558/papers/2381/23810330.

pdf.

REFERENCES 110

Stenz:2002:DSA

[455] Gernot Stenz. DCTP 1.2 —system abstract. Lecture Notesin Computer Science, 2381:335–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2381/23810335.htm; http:/


series/0558/papers/2381/23810335.

pdf.

Anonymous:2002:AIaaar




Segev:2002:EDC

[457] Arie Segev. Enabling design-centriceBusiness applications. Lecture Notesin Computer Science, 2382:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2382/23820001.htm; http:/


series/0558/papers/2382/23820001.

pdf.

Cohen:2002:SPQ

[458] Sara Cohen, Yaron Kanza, andYehoshua Sagiv. Select-project queriesover XML documents. LectureNotes in Computer Science, 2382:2–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2382/23820002.htm; http:/


series/0558/papers/2382/23820002.

pdf.

Balaban:2002:ACR

[459] Mira Balaban, Nikolai Berezansky,and Ehud Gudes. Answering co-operative recursive queries in Webfederated databases. Lecture Notesin Computer Science, 2382:14–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2382/23820014.htm; http:/


series/0558/papers/2382/23820014.

pdf.

Draheim:2002:STS

[460] Dirk Draheim and Gerald Weber.Strongly typed server pages. LectureNotes in Computer Science, 2382:29–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2382/23820029.htm; http:/


series/0558/papers/2382/23820029.

pdf.

Elovici:2002:NPM

[461] Yuval Elovici, Bracha Shapira, andAdlai Maschiach. A new privacymodel for Web surfing. LectureNotes in Computer Science, 2382:45–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 111


bibs/2382/23820045.htm; http:/


series/0558/papers/2382/23820045.

pdf.

Zeinalipour-Yazti:2002:DID

[462] Demetrios Zeinalipour-Yazti and Mar-ios Dikaiakos. Design and imple-mentation of a distributed crawlerand filtering processor. Lecture Notesin Computer Science, 2382:58–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2382/23820058.htm; http:/


series/0558/papers/2382/23820058.

pdf.

Wolfson:2002:MOI

[463] Ouri Wolfson. Moving objects infor-mation management: The databasechallenge. Lecture Notes in ComputerScience, 2382:75–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2382/23820075.



2382/23820075.pdf.

Benaroch:2002:SLO

[464] Michel Benaroch. Specifying local on-tologies in support of semantic in-teroperability of distributed inter-organizational applications. LectureNotes in Computer Science, 2382:90–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2382/23820090.htm; http:/


series/0558/papers/2382/23820090.

pdf.

Kabeli:2002:FOM

[465] Judith Kabeli and Peretz Shoval.FOOM and OPM methodologies — ex-perimental comparison of user compre-hension. Lecture Notes in ComputerScience, 2382:107–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2382/23820107.



2382/23820107.pdf.

Bollen:2002:NLM

[466] Peter Bollen. The natural languagemodeling procedure. Lecture Notesin Computer Science, 2382:123–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2382/23820123.htm; http:/


series/0558/papers/2382/23820123.

pdf.

Bahn:2002:CAS

[467] David Bahn, J. David Naumann, andShawn Curley. Conversation aboutsoftware requirements with proto-types and scenarios. Lecture Notesin Computer Science, 2382:147–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 112

bibs/2382/23820147.htm; http:/


series/0558/papers/2382/23820147.

pdf.

Adi:2002:SMC

[468] Asaf Adi, David Botzer, and OpherEtzion. The situation manager com-ponent of amit — active middle-ware technology. Lecture Notesin Computer Science, 2382:158–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2382/23820158.htm; http:/


series/0558/papers/2382/23820158.

pdf.

Anonymous:2002:AIaaas




Lew:2002:CIV

[470] Michael S. Lew, Nicu Sebe, andJohn P. Eakins. Challenges of im-age and video retrieval. LectureNotes in Computer Science, 2383:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830001.htm; http:/


series/0558/papers/2383/23830001.

pdf.

Tian:2002:VEU

[471] Qi Tian, Baback Moghaddam, andThomas S. Huang. Visualization, es-timation and user-modeling for inter-active browsing of image libraries. Lec-ture Notes in Computer Science, 2383:7–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830007.htm; http:/


series/0558/papers/2383/23830007.

pdf.

Sebe:2002:RSM

[472] Nicu Sebe and Michael Lew. Ro-bust shape matching. Lecture Notesin Computer Science, 2383:17–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830017.htm; http:/


series/0558/papers/2383/23830017.

pdf.

Wang:2002:SBI

[473] Wei Wang, Yuqing Song, and AidongZhang. Semantics-based image re-trieval by region saliency. LectureNotes in Computer Science, 2383:29–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830029.htm; http:/


series/0558/papers/2383/23830029.

pdf.

REFERENCES 113

Muller:2002:TAC

[474] Henning Muller, Stephane Marchand-Maillet, and Thierry Pun. Thetruth about Corel — evaluationin image retrieval. Lecture Notesin Computer Science, 2383:38–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830038.htm; http:/


series/0558/papers/2383/23830038.

pdf.

Bosson:2002:NRB

[475] Alison Bosson, Gavin C. Caw-ley, Yi Chan, and Richard Har-vey. Non-retrieval: Blocking porno-graphic images. Lecture Notesin Computer Science, 2383:50–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830050.htm; http:/


series/0558/papers/2383/23830050.

pdf.

Cox:2002:LIP

[476] Gregory Cox and Gerhard de Jager. Alinear image-pair model and the associ-ated hypothesis test for matching. Lec-ture Notes in Computer Science, 2383:61–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830061.htm; http:/


series/0558/papers/2383/23830061.

pdf.

Smolka:2002:CFB

[477] Bogdan Smolka and Konstantinos N.Plataniotis. On the coupled forwardand backward anisotropic diffusionscheme for color image enhancement.Lecture Notes in Computer Science,2383:70–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2383/23830070.htm; http:


series/0558/papers/2383/23830070.

pdf.

Ko:2002:MRT

[478] ByoungChul Ko and Hyeran Byun.Multiple regions and their spatialrelationship-based image retrieval. Lec-ture Notes in Computer Science, 2383:81–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830081.htm; http:/


series/0558/papers/2383/23830081.

pdf.

Fauzi:2002:QFC

[479] Mohammad F. A. Fauzi and Paul H.Lewis. Query by fax for content-based image retrieval. Lecture Notesin Computer Science, 2383:91–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830091.htm; http:/


series/0558/papers/2383/23830091.

pdf.

REFERENCES 114

Qiu:2002:SLC

[480] Guoping Qiu and Kin-Man. Spec-trally layered color indexing. LectureNotes in Computer Science, 2383:100–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830100.htm; http:/


series/0558/papers/2383/23830100.

pdf.

Wolf:2002:UIR

[481] Jurgen Wolf, Wolfram Burgard, andHans Burkhardt. Using an image re-trieval system for vision-based mo-bile robot localization. Lecture Notesin Computer Science, 2383:108–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830108.htm; http:/


series/0558/papers/2383/23830108.

pdf.

Feng:2002:JIR

[482] Guocan Feng and Jianmin Jiang.JPEG image retrieval based on fea-tures from DCT domain. LectureNotes in Computer Science, 2383:120–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830120.htm; http:/


series/0558/papers/2383/23830120.

pdf.

Howell:2002:IRM

[483] A. Jonathan Howell and David S.Young. Image retrieval methods for adatabase of funeral monuments. Lec-ture Notes in Computer Science, 2383:129–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830129.htm; http:/


series/0558/papers/2383/23830129.

pdf.

Bruijn:2002:AMP

[484] Willem de Bruijn and Michael S.Lew. AtomsNet: Multimediapeer2peer file sharing. Lecture Notesin Computer Science, 2383:138–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830138.htm; http:/


series/0558/papers/2383/23830138.

pdf.

Hussain:2002:VCT

[485] Mustaq Hussain, John Eakins, andGraham Sexton. Visual cluster-ing of trademarks using the self-organizing map. Lecture Notesin Computer Science, 2383:147–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830147.htm; http:/


series/0558/papers/2383/23830147.

pdf.

REFERENCES 115

Ruiz-del-Solar:2002:FIF

[486] Javier Ruiz del Solar and PabloNavarrete. FACERET: An interac-tive face retrieval system based onself-organizing maps. Lecture Notesin Computer Science, 2383:157–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830157.htm; http:/


series/0558/papers/2383/23830157.

pdf.

Leung:2002:OBI

[487] Man-Wai Leung and Kwok-LeungChan. Object-based image retrieval us-ing hierarchical shape descriptor. Lec-ture Notes in Computer Science, 2383:165–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830165.htm; http:/


series/0558/papers/2383/23830165.

pdf.

Vendrig:2002:MPI

[488] Jeroen Vendrig and Marcel Wor-ring. Multimodal person identifi-cation in movies. Lecture Notesin Computer Science, 2383:175–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830175.htm; http:/


series/0558/papers/2383/23830175.

pdf.

Schaffalitzky:2002:ASM

[489] F. Schaffalitzky and A. Zisserman. Au-tomated scene matching in movies. Lec-ture Notes in Computer Science, 2383:186–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830186.htm; http:/


series/0558/papers/2383/23830186.

pdf.

Denman:2002:CBA

[490] H. Denman, N. Rea, and A. Kokaram.Content based analysis for video fromsnooker broadcasts. Lecture Notesin Computer Science, 2383:198–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830198.htm; http:/


series/0558/papers/2383/23830198.

pdf.

Enser:2002:RAM

[491] Peter G. B. Enser and Criss J. San-dom. Retrieval of archival moving im-agery — CBIR outside the frame? Lec-ture Notes in Computer Science, 2383:206–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830206.htm; http:/


series/0558/papers/2383/23830206.

pdf.

REFERENCES 116

Smeaton:2002:CCB

[492] Alan F. Smeaton. Challenges forcontent-based navigation of digitalvideo in the Fıschlar digital library.Lecture Notes in Computer Science,2383:215–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2383/23830215.htm; http:


series/0558/papers/2383/23830215.

pdf.

Alarcon:2002:SIN

[493] Pedro A. de Alarcon, Alberto D.Pascual-Montano, and Jose M. Carazo.Spin images and neural networksfor efficient content-based retrieval in3D object databases. Lecture Notesin Computer Science, 2383:225–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830225.htm; http:/


series/0558/papers/2383/23830225.

pdf.

Brucale:2002:SFI

[494] A. Brucale, M. d’Amico, M. Ferri,L. Gualandri, and A. Lovato. Size func-tions for image retrieval: A demonstra-tor on randomly generated curves. Lec-ture Notes in Computer Science, 2383:235–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830235.htm; http:/


series/0558/papers/2383/23830235.

pdf.

Berens:2002:ECT

[495] Jeff Berens and Graham D. Fin-layson. An efficient coding ofthree dimensional colour distributionsfor image retrieval. Lecture Notesin Computer Science, 2383:245–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830245.htm; http:/


series/0558/papers/2383/23830245.

pdf.

Riley:2002:CBR

[496] K. Jonathan Riley and John P. Eakins.Content-based retrieval of historicalwatermark images: I-tracings. LectureNotes in Computer Science, 2383:253–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830253.htm; http:/


series/0558/papers/2383/23830253.

pdf.

Visser:2002:ORV

[497] Rene Visser, Nicu Sebe, and Er-win Bakker. Object recognitionfor video retrieval. Lecture Notesin Computer Science, 2383:262–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830262.htm; http:/


REFERENCES 117

series/0558/papers/2383/23830262.

pdf.

Bakker:2002:SVR

[498] Erwin M. Bakker and Michael S.Lew. Semantic video retrieval us-ing audio analysis. Lecture Notesin Computer Science, 2383:271–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830271.htm; http:/


series/0558/papers/2383/23830271.

pdf.

Kim:2002:ESI

[499] Kyungsu Kim, Junho Choi, NamjungKim, and Pankoo Kim. Ex-tracting semantic information frombasketball video based on audio-visual features. Lecture Notesin Computer Science, 2383:278–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830278.htm; http:/


series/0558/papers/2383/23830278.

pdf.

Huang:2002:VIR

[500] Jeffrey Huang, Deepa Umamah-eswaran, and Mathew Palakal. Videoindexing and retrieval for archeolog-ical digital library, CLIOH. LectureNotes in Computer Science, 2383:289–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830289.htm; http:/


series/0558/papers/2383/23830289.

pdf.

Oh:2002:FNI

[501] Kun Seok Oh, Aghbari Zaher, andPan Koo Kim. Fast k-NN image searchwith self-organizing maps. LectureNotes in Computer Science, 2383:299–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830299.htm; http:/


series/0558/papers/2383/23830299.

pdf.

Pickering:2002:VRF

[502] Marcus J. Pickering, Stefan M. Ruger,and David Sinclair. Video retrieval byfeature learning in key frames. Lec-ture Notes in Computer Science, 2383:309–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830309.htm; http:/


series/0558/papers/2383/23830309.

pdf.

Obdrzalek:2002:LAF

[503] Stepan Obdrzalek and Jirı Matas. Lo-cal affine frames for image retrieval.Lecture Notes in Computer Science,2383:318–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2383/23830318.htm; http:


REFERENCES 118

series/0558/papers/2383/23830318.

pdf.

Park:2002:RAU

[504] Gunhan Park, Yunju Baek, and Heung-Kyu Lee. A ranking algorithm us-ing dynamic clustering for content-based image retrieval. Lecture Notesin Computer Science, 2383:328–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830328.htm; http:/


series/0558/papers/2383/23830328.

pdf.

Orriols:2002:OBV

[505] Xavier Orriols and Xavier Binefa.Online Bayesian video summariza-tion and linking. Lecture Notesin Computer Science, 2383:338–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830338.htm; http:/


series/0558/papers/2383/23830338.

pdf.

Viallet:2002:FDV

[506] Jean Emmanuel Viallet and OlivierBernier. Face detection for video sum-maries. Lecture Notes in ComputerScience, 2383:348–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2383/23830348.



2383/23830348.pdf.

Black:2002:MEP

[507] John A. Black, Jr., Gamal Fahmy,and Sethuraman Panchanathan. Amethod for evaluating the performanceof content-based image retrieval sys-tems based on subjectively determinedsimilarity between images. LectureNotes in Computer Science, 2383:356–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830356.htm; http:/


series/0558/papers/2383/23830356.

pdf.

Sebe:2002:ESP

[508] N. Sebe, Q. Tian, E. Loupias, M. Lew,and T. Huang. Evaluation of salientpoint techniques. Lecture Notesin Computer Science, 2383:367–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2383/23830367.htm; http:/


series/0558/papers/2383/23830367.

pdf.

Burke:2002:PCT

[509] Mary A. Burke. Personal constructtheory as a research tool for analysinguser perceptions of photographs. Lec-ture Notes in Computer Science, 2383:378–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 119

bibs/2383/23830378.htm; http:/


series/0558/papers/2383/23830378.

pdf.

Anonymous:2002:AIaaat




Biehl:2002:NDP

[511] Ingrid Biehl and Tsuyoshi Tak-agi. A new distributed primal-ity test for shared RSA keys us-ing quadratic fields. Lecture Notesin Computer Science, 2384:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840001.htm; http:/


series/0558/papers/2384/23840001.

pdf.

Yang:2002:SAI

[512] Yanjiang Yang, Feng Bao, andRobert H. Deng. Security analy-sis and improvement of the globalkey recovery system. Lecture Notesin Computer Science, 2384:17–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840017.htm; http:/


series/0558/papers/2384/23840017.

pdf.

Clark:2002:LIK

[513] A. Clark, Ed Dawson, J. Fuller,J. Golic, H-J. Lee, William Millan,S-J. Moon, and L. Simpson. TheLILI-II keystream generator. LectureNotes in Computer Science, 2384:25–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840025.htm; http:/


series/0558/papers/2384/23840025.

pdf.

Kurnio:2002:SRK

[514] Hartono Kurnio, Rei Safavi-Naini,and Huaxiong Wang. A se-cure re-keying scheme with key re-covery property. Lecture Notesin Computer Science, 2384:40–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840040.htm; http:/


series/0558/papers/2384/23840040.

pdf.

Henderson:2002:MTS

[515] Marie Henderson, Robert Coulter,Ed Dawson, and Eiji Okamoto. Mod-elling trust structures for publickey infrastructures. Lecture Notesin Computer Science, 2384:56–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840056.htm; http:/


REFERENCES 120

series/0558/papers/2384/23840056.

pdf.

Barwick:2002:SBT

[516] S. G. Barwick, W.-A. Jackson,Keith M. Martin, and Peter R.Wild. Size of broadcast in thresholdschemes with disenrollment. LectureNotes in Computer Science, 2384:71–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840071.htm; http:/


series/0558/papers/2384/23840071.

pdf.

King:2002:RGI

[517] Brian King. Requirements for groupindependent linear threshold secretsharing schemes. Lecture Notesin Computer Science, 2384:89–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840089.htm; http:/


series/0558/papers/2384/23840089.

pdf.

Bennett:2002:ESE

[518] Krista Bennett, Christian Grothoff,Tzvetan Horozov, and Ioana Patrascu.Efficient sharing of encrypted data.Lecture Notes in Computer Science,2384:107–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2384/23840107.htm; http:


series/0558/papers/2384/23840107.

pdf.

Pieprzyk:2002:CPL

[519] Josef Pieprzyk and Xian-Mo Zhang.Cheating prevention in linear secretsharing. Lecture Notes in ComputerScience, 2384:121–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2384/23840121.



2384/23840121.pdf.

Fischer:2002:NFC

[520] Wieland Fischer and Jean-PierreSeifert. Note on fast computationof secret RSA exponents. LectureNotes in Computer Science, 2384:136–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840136.htm; http:/


series/0558/papers/2384/23840136.

pdf.

Reyzin:2002:BTB

[521] Leonid Reyzin and Natan Reyzin.Better than BiBa: Short one-time signatures with fast sign-ing and verifying. Lecture Notesin Computer Science, 2384:144–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840144.htm; http:/


REFERENCES 121

series/0558/papers/2384/23840144.

pdf.

Wu:2002:CSCa

[522] Hongjun Wu and Feng Bao. Cryptanal-ysis of stream cipher COS(2,128) ModeI. Lecture Notes in Computer Science,2384:154–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2384/23840154.htm; http:


series/0558/papers/2384/23840154.

pdf.

Soldera:2002:AZS

[523] David Soldera, Jennifer Seberry, andChengxin Qu. The analysis ofzheng-seberry scheme. Lecture Notesin Computer Science, 2384:159–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840159.htm; http:/


series/0558/papers/2384/23840159.

pdf.

Wu:2002:CSCb

[524] Hongjun Wu. Cryptanalysis ofstream cipher Alpha1. Lecture Notesin Computer Science, 2384:169–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840169.htm; http:/


series/0558/papers/2384/23840169.

pdf.

Hughes:2002:LAA

[525] James Hughes. A linear alge-braic attack on the AAFG1 braidgroup cryptosystem. Lecture Notesin Computer Science, 2384:176–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840176.htm; http:/


series/0558/papers/2384/23840176.

pdf.

Choie:2002:ICH

[526] Y. Choie and D. Yun. Isomor-phism classes of hyperelliptic curvesof genus 2 over Fq. Lecture Notesin Computer Science, 2384:190–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840190.htm; http:/


series/0558/papers/2384/23840190.

pdf.

Zhang:2002:CRD

[527] Fangguo Zhang, Shengli Liu, andKwangjo Kim. Compact representa-tion of domain parameters of hyper-elliptic curve cryptosystems. LectureNotes in Computer Science, 2384:203–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840203.htm; http:/


series/0558/papers/2384/23840203.

pdf.

REFERENCES 122

Hitchcock:2002:NEC

[528] Yvonne Hitchcock and Paul Mon-tague. A new elliptic curve scalarmultiplication algorithm to resist sim-ple power analysis. Lecture Notesin Computer Science, 2384:214–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840214.htm; http:/


series/0558/papers/2384/23840214.

pdf.

May:2002:SKS

[529] Lauren May, Matt Henricksen, WilliamMillan, Gary Carter, and Ed Daw-son. Strengthening the key sched-ule of the AES. Lecture Notesin Computer Science, 2384:226–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840226.htm; http:/


series/0558/papers/2384/23840226.

pdf.

Steinfeld:2002:NSA

[530] Ron Steinfeld, Joonsang Baek, andYuliang Zheng. On the necessityof strong assumptions for the secu-rity of a class of asymmetric en-cryption schemes. Lecture Notesin Computer Science, 2384:241–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840241.htm; http:/


series/0558/papers/2384/23840241.

pdf.

Warren:2002:SMI

[531] M. J. Warren and L. M. Batten.Security management: An informa-tion systems setting. Lecture Notesin Computer Science, 2384:257–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840257.htm; http:/


series/0558/papers/2384/23840257.

pdf.

Ruan:2002:RCA

[532] Chun Ruan and Vijay Varadhara-jan. Resolving conflicts in autho-rization delegations. Lecture Notesin Computer Science, 2384:271–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840271.htm; http:/


series/0558/papers/2384/23840271.

pdf.

Hitchens:2002:PAD

[533] M. Hitchens, Vijay Varadharajan,and G. Saunders. Policy admin-istration domains. Lecture Notesin Computer Science, 2384:286–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840286.htm; http:/


REFERENCES 123

series/0558/papers/2384/23840286.

pdf.

Zhou:2002:MVD

[534] Jianying Zhou. Maintaining thevalidity of digital signatures inB2B applications. Lecture Notesin Computer Science, 2384:303–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840303.htm; http:/


series/0558/papers/2384/23840303.

pdf.

Sebe:2002:SSF

[535] Francesc Sebe and Josep Domingo-Ferrer. Short 3-secure fingerprintingcodes for copyright protection. LectureNotes in Computer Science, 2384:316–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840316.htm; http:/


series/0558/papers/2384/23840316.

pdf.

Tada:2002:OSM

[536] Mitsuru Tada. An order-specified mul-tisignature scheme secure against ac-tive insider attacks. Lecture Notesin Computer Science, 2384:328–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840328.htm; http:/


series/0558/papers/2384/23840328.

pdf.

England:2002:AOO

[537] Paul England and Marcus Peinado.Authenticated operation of opencomputing devices. Lecture Notesin Computer Science, 2384:346–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840346.htm; http:/


series/0558/papers/2384/23840346.

pdf.

Kim:2002:NIS

[538] Myungsun Kim and Kwangjo Kim. Anew identification scheme based on thebilinear Diffie–Hellman problem. Lec-ture Notes in Computer Science, 2384:362–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840362.htm; http:/


series/0558/papers/2384/23840362.

pdf.

Roy:2002:BOR

[539] Bimal Roy. A brief outline of researchon correlation immune functions. Lec-ture Notes in Computer Science, 2384:379–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840379.htm; http:/


series/0558/papers/2384/23840379.

pdf.

REFERENCES 124

Mu:2002:OT

[540] Yi Mu, Junqi Zhang, and Vi-jay Varadharajan. m out of noblivious transfer. Lecture Notesin Computer Science, 2384:395–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840395.htm; http:/


series/0558/papers/2384/23840395.

pdf.

Park:2002:SRV

[541] Sangwoo Park, Soo Hak Sung, Seong-taek Chee, and Jongin Lim. Onthe security of reduced versionsof 3-pass HAVAL. Lecture Notesin Computer Science, 2384:406–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840406.htm; http:/


series/0558/papers/2384/23840406.

pdf.

Okeya:2002:ISC

[542] Katsuyuki Okeya and Kouichi Saku-rai. On insecurity of the sidechannel attack countermeasure us-ing addition-subtraction chains un-der distinguishability between addi-tion and doubling. Lecture Notesin Computer Science, 2384:420–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840420.htm; http:/


series/0558/papers/2384/23840420.

pdf.

Sakurai:2002:SMP

[543] Kouichi Sakurai and Tsuyoshi Tak-agi. On the security of a modifiedPaillier public-key primitive. LectureNotes in Computer Science, 2384:436–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840436.htm; http:/


series/0558/papers/2384/23840436.

pdf.

Cubaleska:2002:HPS

[544] Biljana Cubaleska, Weidong Qiu,and Markus Schneider. How toplay Sherlock Holmes in the worldof mobile agents. Lecture Notesin Computer Science, 2384:449–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840449.htm; http:/


series/0558/papers/2384/23840449.

pdf.

Han:2002:PAD

[545] Dong-Guk Han, Hye-Young Park,Young-Ho Park, Sangjin Lee, Dong HoonLee, and Hyung-Jin Yang. A practicalapproach defeating blackmailing. Lec-ture Notes in Computer Science, 2384:464–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840464.htm; http:/

REFERENCES 125


series/0558/papers/2384/23840464.

pdf.

Kim:2002:PAP

[546] Hyun-Jeong Kim, Dong Hoon Lee,and Moti Yung. Privacy againstpiracy: Protecting two-level revo-cable P-K traitor tracing. LectureNotes in Computer Science, 2384:482–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840482.htm; http:/


series/0558/papers/2384/23840482.

pdf.

Kumar:2002:APS

[547] M. V. N. Ashwin Kumar, K. Srinathan,and C. Pandu Rangan. Asynchronousperfectly secure computation tolerat-ing generalized adversaries. LectureNotes in Computer Science, 2384:497–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2384/23840497.htm; http:/


series/0558/papers/2384/23840497.

pdf.

Anonymous:2002:AIaaau




Freuder:2002:CA

[549] Eugene C. Freuder. Constraint ac-quisition. Lecture Notes in ComputerScience, 2385:1–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2385/23850001.



2385/23850001.pdf.

Colmerauer:2002:ECF

[550] Alain Colmerauer. Expressivenessand complexity of full first-order con-straints in the algebra of trees. Lec-ture Notes in Computer Science, 2385:2–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850002.htm; http:/


series/0558/papers/2385/23850002.

pdf.

Deplagne:2002:DVC

[551] Eric Deplagne and Claude Kirch-ner. Deduction versus computa-tion: The case of induction. LectureNotes in Computer Science, 2385:4–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850004.htm; http:/


series/0558/papers/2385/23850004.

pdf.

Sturm:2002:IQE

[552] Thomas Sturm. Integration ofquantifier elimination with constraint

REFERENCES 126

logic programming. Lecture Notesin Computer Science, 2385:7–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850007.htm; http:/


series/0558/papers/2385/23850007.

pdf.

Chetty:2002:THS

[553] Madhu Chetty. Towards a hybridsymbolic/numeric computational ap-proach in controller design. LectureNotes in Computer Science, 2385:12–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850012.htm; http:/


series/0558/papers/2385/23850012.

pdf.

Kitzelmann:2002:ISF

[554] Emanuel Kitzelmann, Ute Schmid,Martin Muhlpfordt, and Fritz Wysotzki.Inductive synthesis of functional pro-grams. Lecture Notes in ComputerScience, 2385:26–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2385/23850026.



2385/23850026.pdf.

Herrero:2002:SCB

[555] Begona Herrero, Luis M. Laita, Eu-genio Roanes-Lozano, Vıctor Maojo,Luis de Ledesma, JoseCrespo, and

Laura Laita. A symbolic computation-based expert system for alzheimer’sdisease diagnosis. Lecture Notesin Computer Science, 2385:38–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850038.htm; http:/


series/0558/papers/2385/23850038.

pdf.

Aiguier:2002:GLT

[556] Marc Aiguier, Diane Bahrami, andCatherine Dubois. On a gener-alised logicality theorem. LectureNotes in Computer Science, 2385:51–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850051.htm; http:/


series/0558/papers/2385/23850051.

pdf.

Smirnova:2002:USC

[557] Elena Smirnova. Using symbolic com-putation in an automated sequentderivation system for multi-valuedlogic. Lecture Notes in ComputerScience, 2385:64–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2385/23850064.



2385/23850064.pdf.

Corless:2002:W

[558] Robert M. Corless and D. J. Jef-

REFERENCES 127

frey. The Wright ω function. LectureNotes in Computer Science, 2385:76–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850076.htm; http:/


series/0558/papers/2385/23850076.

pdf.

Nossum:2002:MLS

[559] Rolf Nossum and Luciano Ser-afini. Multicontext logic for semi-groups of contexts. Lecture Notesin Computer Science, 2385:90–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850090.htm; http:/


series/0558/papers/2385/23850090.

pdf.

Campbell:2002:IIT

[560] J. A. Campbell. Indefinite integra-tion as a testbed for developments inmulti-agent systems. Lecture Notesin Computer Science, 2385:102–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850102.htm; http:/


series/0558/papers/2385/23850102.

pdf.

Hunter:2002:EIG

[561] Andrew Hunter. Expression infer-ence — genetic symbolic classifica-tion integrated with non-linear coef-

ficient optimisation. Lecture Notesin Computer Science, 2385:117–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850117.htm; http:/


series/0558/papers/2385/23850117.

pdf.

Bai:2002:NFR

[562] Li Bai and Yihui Liu. A novel facerecognition method. Lecture Notesin Computer Science, 2385:128–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850128.htm; http:/


series/0558/papers/2385/23850128.

pdf.

Castaing:2002:NCL

[563] Jacqueline Castaing. Non-commutativelogic for hand-written character mod-eling. Lecture Notes in Computer Sci-ence, 2385:136–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2385/23850136.



2385/23850136.pdf.

Loriette-Rougegrez:2002:NSD

[564] S. Loriette-Rougegrez. From numeri-cal to symbolic data during the recog-nition of scenarii. Lecture Notesin Computer Science, 2385:154–??,2002. CODEN LNCSD9. ISSN

REFERENCES 128



bibs/2385/23850154.htm; http:/


series/0558/papers/2385/23850154.

pdf.

Bernhaupt:2002:MMN

[565] Regina Bernhaupt and Jochen Pfalz-graf. On mathematical model-ing of networks and implemen-tation aspects. Lecture Notesin Computer Science, 2385:168–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850168.htm; http:/


series/0558/papers/2385/23850168.

pdf.

Ratschan:2002:CFO

[566] Stefan Ratschan. Continuous first-order constraint satisfaction. LectureNotes in Computer Science, 2385:181–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850181.htm; http:/


series/0558/papers/2385/23850181.

pdf.

Golumbic:2002:CAT

[567] Martin Charles Golumbic and AssafSiani. Coloring algorithms for toler-ance graphs: Reasoning and schedul-ing with interval constraints. LectureNotes in Computer Science, 2385:196–??, 2002. CODEN LNCSD9. ISSN



bibs/2385/23850196.htm; http:/


series/0558/papers/2385/23850196.

pdf.

Tounsi:2002:GBA

[568] Mohamed Tounsi. A genetic-based ap-proach for satisfiability problems. Lec-ture Notes in Computer Science, 2385:208–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850208.htm; http:/


series/0558/papers/2385/23850208.

pdf.

Subramani:2002:ISQ

[569] K. Subramani. On identifying sim-ple and quantified lattice points inthe 2SAT polytope. Lecture Notesin Computer Science, 2385:217–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850217.htm; http:/


series/0558/papers/2385/23850217.

pdf.

Audemard:2002:IBM

[570] Gilles Audemard, Piergiorgio Bertoli,Alessandro Cimatti, Artur Korni lowicz,and Roberto Sebastiani. Integrat-ing Boolean and mathematical solv-ing: Foundations, basic algorithms,and requirements. Lecture Notesin Computer Science, 2385:231–??,

REFERENCES 129



bibs/2385/23850231.htm; http:/


series/0558/papers/2385/23850231.

pdf.

Beeson:2002:MIC

[571] Michael Beeson and Freek Wiedijk.The meaning of infinity in calculusand computer algebra systems. Lec-ture Notes in Computer Science, 2385:246–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850246.htm; http:/


series/0558/papers/2385/23850246.

pdf.

Colton:2002:MCA

[572] Simon Colton. Making conjecturesabout Maple functions. Lecture Notesin Computer Science, 2385:259–274,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850259.htm; http:/


series/0558/papers/2385/23850259.

pdf.

Meier:2002:ETF

[573] Andreas Meier, Volker Sorge, and Si-mon Colton. Employing theory forma-tion to guide proof planning. LectureNotes in Computer Science, 2385:275–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2385/23850275.htm; http:/


series/0558/papers/2385/23850275.

pdf.

Kutsia:2002:USV

[574] Temur Kutsia. Unification with se-quence variables and flexible arity sym-bols and its extension with pattern-terms. Lecture Notes in ComputerScience, 2385:290–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2385/23850290.



2385/23850290.pdf.

Ranise:2002:CGD

[575] Silvio Ranise. Combining genericand domain specific reasoning byusing contexts. Lecture Notesin Computer Science, 2385:305–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850305.htm; http:/


series/0558/papers/2385/23850305.

pdf.

Zimmer:2002:ITP

[576] Jurgen Zimmer and Louise A. Den-nis. Inductive theorem provingand computer algebra in the Math-Web software bus. Lecture Notesin Computer Science, 2385:319–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 130



bibs/2385/23850319.htm; http:/


series/0558/papers/2385/23850319.

pdf.

Pinkus:2002:ADI

[577] Ayal Z. Pinkus and Serge Winitzki.Y ACAS: A do-it-yourself symbolicalgebra environment. Lecture Notesin Computer Science, 2385:332–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850332.htm; http:/


series/0558/papers/2385/23850332.

pdf.

Piroi:2002:FWN

[578] Florina Piroi and Bruno Buchberger.Focus windows: A new technique forproof presentation. Lecture Notesin Computer Science, 2385:337–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2385/23850337.htm; http:/


series/0558/papers/2385/23850337.

pdf.

Anonymous:2002:AIaaav




Giegerich:2002:IAD

[580] Robert Giegerich and Peter Steffen.Implementing algebraic dynamic pro-gramming in the functional and the im-perative programming paradigm. Lec-ture Notes in Computer Science, 2386:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860001.htm; http:/


series/0558/papers/2386/23860001.

pdf.

Kozen:2002:SRD

[581] Dexter Kozen. Some results in dy-namic model theory. Lecture Notesin Computer Science, 2386:21–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860021.htm; http:/


series/0558/papers/2386/23860021.

pdf.

Wing:2002:MCS

[582] Jeannette M. Wing. Mathematics incomputer science curricula. LectureNotes in Computer Science, 2386:22–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860022.htm; http:/


series/0558/papers/2386/23860022.

pdf.

REFERENCES 131

Backhouse:2002:LRG

[583] Kevin Backhouse and Roland Back-house. Logical relations and Ga-lois connections. Lecture Notesin Computer Science, 2386:23–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860023.htm; http:/


series/0558/papers/2386/23860023.

pdf.

Duran:2002:TDG

[584] Juan Eduardo Duran. Trans-formational derivation of greedynetwork algorithms from descrip-tive specifications. Lecture Notesin Computer Science, 2386:40–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860040.htm; http:/


series/0558/papers/2386/23860040.

pdf.

Harrison:2002:FCD

[585] William Harrison, Tim Sheard, andJames Hook. Fine control of de-mand in haskell. Lecture Notesin Computer Science, 2386:68–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860068.htm; http:/


series/0558/papers/2386/23860068.

pdf.

Hayes:2002:RAT

[586] Ian J. Hayes. Reasoning about time-outs. Lecture Notes in ComputerScience, 2386:94–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2386/23860094.



2386/23860094.pdf.

Hesselink:2002:EVS

[587] Wim H. Hesselink. Eternity vari-ables to simulate specifications. Lec-ture Notes in Computer Science, 2386:117–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860117.htm; http:/


series/0558/papers/2386/23860117.

pdf.

Hinze:2002:CTR

[588] Ralf Hinze. Constructing tournamentrepresentations: An exercise in point-wise relational programming. LectureNotes in Computer Science, 2386:131–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860131.htm; http:/


series/0558/papers/2386/23860131.

pdf.

Hinze:2002:TID

[589] Ralf Hinze, Johan Jeuring, and AndresLoh. Type-indexed data types. Lec-ture Notes in Computer Science, 2386:

REFERENCES 132



bibs/2386/23860148.htm; http:/


series/0558/papers/2386/23860148.

pdf.

Huisman:2002:VJA

[590] Marieke Huisman. Verificationof Java’s AbstractCollection class:A case study. Lecture Notesin Computer Science, 2386:175–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860175.htm; http:/


series/0558/papers/2386/23860175.

pdf.

Liu:2002:SRP

[591] Yanhong A. Liu and Fuxiang Yu. Solv-ing regular path queries. LectureNotes in Computer Science, 2386:195–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860195.htm; http:/


series/0558/papers/2386/23860195.

pdf.

Mu:2002:IFF

[592] Shin-Cheng Mu and Richard Bird. In-verting functions as folds. LectureNotes in Computer Science, 2386:209–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860209.htm; http:/


series/0558/papers/2386/23860209.

pdf.

Wright:2002:KAR

[593] Joakim von Wright. From Kleene al-gebra to refinement algebra. LectureNotes in Computer Science, 2386:233–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2386/23860233.htm; http:/


series/0558/papers/2386/23860233.

pdf.

Anonymous:2002:AIaaaw



papers/2386/23860263.pdf.

Myers:2002:AHM

[595] Gene Myers. The assembly of thehuman and mouse genomes. LectureNotes in Computer Science, 2387:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870001.htm; http:/


series/0558/papers/2387/23870001.

pdf.

REFERENCES 133

Sahni:2002:DSO

[596] Sartaj Sahni. Data structures for one-dimensional packet classification usingmost-specific-rule matching. LectureNotes in Computer Science, 2387:2–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870002.htm; http:/


series/0558/papers/2387/23870002.

pdf.

Salomaa:2002:DCP

[597] Arto Salomaa. DNA complementar-ity and paradigms of computing. Lec-ture Notes in Computer Science, 2387:3–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870003.htm; http:/


series/0558/papers/2387/23870003.

pdf.

Cai:2002:HAM

[598] Jin-Yi Cai, Denis Charles, A. Pa-van, and Samik Sengupta. Onhigher Arthur–Merlin classes. LectureNotes in Computer Science, 2387:18–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870018.htm; http:/


series/0558/papers/2387/23870018.

pdf.

Deng:2002:SP

[599] Xiaotie Deng, C. H. Lee, YunleiZhao, and Hong Zhu. (2 + f(n))-SAT and its properties. LectureNotes in Computer Science, 2387:28–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870028.htm; http:/


series/0558/papers/2387/23870028.

pdf.

Hoang:2002:MPM

[600] Thanh Minh Hoang and ThomasThierauf. On the minimal polyno-mial of a matrix. Lecture Notesin Computer Science, 2387:37–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870037.htm; http:/


series/0558/papers/2387/23870037.

pdf.

Rettinger:2002:CRF

[601] Robert Rettinger, Xizhong Zheng, andBurchard von Braunmuhl. Com-putable real functions of bounded vari-ation and semi-computable real num-bers (extended abstract). LectureNotes in Computer Science, 2387:47–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870047.htm; http:/


series/0558/papers/2387/23870047.

pdf.

REFERENCES 134

Lu:2002:ICR

[602] Hsueh-I Lu. Improved compact rout-ing tables for planar networks via or-derly spanning trees. Lecture Notesin Computer Science, 2387:57–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870057.htm; http:/


series/0558/papers/2387/23870057.

pdf.

Gabow:2002:CAS

[603] Harold N. Gabow and San Skul-rattanakulchai. Coloring algorithmson subcubic graphs. Lecture Notesin Computer Science, 2387:67–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870067.htm; http:/


series/0558/papers/2387/23870067.

pdf.

Hsieh:2002:EAH

[604] Sun yuan Hsieh, Chin wen Ho, Tsansheng Hsu, and Ming tat Ko. Efficientalgorithms for the Hamiltonian prob-lem on distance-hereditary graphs. Lec-ture Notes in Computer Science, 2387:77–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870077.htm; http:/


series/0558/papers/2387/23870077.

pdf.

Boyar:2002:EAF

[605] Joan Boyar, Lene M. Favrholdt,Kim S. Larsen, and Morten N.Nielsen. Extending the accom-modating function. Lecture Notesin Computer Science, 2387:87–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870087.htm; http:/


series/0558/papers/2387/23870087.

pdf.

Sun:2002:IPS

[606] Fangting Sun, David Fernandez-Baca,and Wei Yu. Inverse parametricsequence alignment. Lecture Notesin Computer Science, 2387:97–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870097.htm; http:/


series/0558/papers/2387/23870097.

pdf.

Lu:2002:FST

[607] Chin Lung Lu, Chuan Yi Tang, andRichard Chia-Tung Lee. The fullSteiner tree problem in phylogeny. Lec-ture Notes in Computer Science, 2387:107–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870107.htm; http:/


series/0558/papers/2387/23870107.

pdf.

REFERENCES 135

Akutsu:2002:IUH

[608] Tatsuya Akutsu and Sascha Ott.Inferring a union of halfspacesfrom examples. Lecture Notesin Computer Science, 2387:117–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870117.htm; http:/


series/0558/papers/2387/23870117.

pdf.

Arslan:2002:DLW

[609] Abdullah N. Arslan and OmerEgecioglu. Dictionary look-up withinsmall edit distance. Lecture Notesin Computer Science, 2387:127–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870127.htm; http:/


series/0558/papers/2387/23870127.

pdf.

Lange:2002:PIE

[610] Tanja Lange and Arne Winter-hof. Polynomial interpolation ofthe elliptic curve and XTR dis-crete logarithm. Lecture Notesin Computer Science, 2387:137–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870137.htm; http:/


series/0558/papers/2387/23870137.

pdf.

Grolmusz:2002:COC

[611] Vince Grolmusz. Co-orthogonal codes(extended abstract). Lecture Notesin Computer Science, 2387:144–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870144.htm; http:/


series/0558/papers/2387/23870144.

pdf.

Kim:2002:EPS

[612] Nam-Yeun Kim, Won-Ho Lee, andKee-Young Yoo. Efficient power-sumsystolic architectures for public-keycryptosystems in GF(2m ). LectureNotes in Computer Science, 2387:153–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870153.htm; http:/


series/0558/papers/2387/23870153.

pdf.

Wang:2002:CAA

[613] Huaxiong Wang and Josef Pieprzyk.A combinatorial approach to anony-mous membership broadcast. LectureNotes in Computer Science, 2387:162–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870162.htm; http:/


series/0558/papers/2387/23870162.

pdf.

REFERENCES 136

Dantsin:2002:SCS

[614] Evgeny Dantsin and Alexander Wolpert.Solving constraint satisfaction prob-lems with DNA computing. LectureNotes in Computer Science, 2387:171–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870171.htm; http:/


series/0558/papers/2387/23870171.

pdf.

Jigang:2002:NAA

[615] Wu Jigang, Heiko Schroder, and Tham-bipillai Srikanthan. New architec-ture and algorithms for degradableVLSI/WSI arrays. Lecture Notesin Computer Science, 2387:181–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870181.htm; http:/


series/0558/papers/2387/23870181.

pdf.

Carter:2002:CFT

[616] Casey Carter and Nicholas Tran. Clus-ter: A fast tool to identify groupsof similar programs. Lecture Notesin Computer Science, 2387:191–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870191.htm; http:/


series/0558/papers/2387/23870191.

pdf.

Kikuchi:2002:BGB

[617] Yosuke Kikuchi, Shingo Osawa, andYukio Shibata. Broadcasting ingeneralized de Bruijn digraphs (ex-tended abstract). Lecture Notesin Computer Science, 2387:200–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870200.htm; http:/


series/0558/papers/2387/23870200.

pdf.

Duckworth:2002:CDN

[618] William Duckworth and BernardMans. On the connected dominationnumber of random regular graphs. Lec-ture Notes in Computer Science, 2387:210–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870210.htm; http:/


series/0558/papers/2387/23870210.

pdf.

Chandran:2002:NMC

[619] L. Sunil Chandran and L. ShankarRam. On the number of minimumcuts in a graph. Lecture Notesin Computer Science, 2387:220–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870220.htm; http:/


series/0558/papers/2387/23870220.

pdf.

REFERENCES 137

Chia:2002:CNR

[620] G. L. Chia and C. S. Gan. On cross-ing numbers of 5-regular graphs. Lec-ture Notes in Computer Science, 2387:230–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870230.htm; http:/


series/0558/papers/2387/23870230.

pdf.

Desmedt:2002:MFC

[621] Yvo Desmedt and Yongge Wang. Max-imum flows and critical vertices inAND/OR graphs (extended abstract).Lecture Notes in Computer Science,2387:238–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2387/23870238.htm; http:


series/0558/papers/2387/23870238.

pdf.

Datta:2002:NEE

[622] Amitava Datta and Albert Y. Zomaya.New energy-efficient permutation rout-ing protocol for single-hop radio net-works. Lecture Notes in ComputerScience, 2387:249–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2387/23870249.



2387/23870249.pdf.

Takamura:2002:SME

[623] Masataka Takamura and YoshihideIgarashi. Simple mutual exclu-sion algorithms based on boundedtickets on the asynchronous sharedmemory model. Lecture Notesin Computer Science, 2387:259–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870259.htm; http:/


series/0558/papers/2387/23870259.

pdf.

Nakano:2002:TEO

[624] Koji Nakano. Time and en-ergy optimal list ranking algorithmson the k-channel broadcast com-munication model. Lecture Notesin Computer Science, 2387:269–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870269.htm; http:/


series/0558/papers/2387/23870269.

pdf.

Jurdzinski:2002:EES

[625] Tomasz Jurdzinski, Miros law Kuty lowski,and Jan Zatopianski. Energy-efficientsize approximation of radio networkswith no collision detection. LectureNotes in Computer Science, 2387:279–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870279.htm; http:/


REFERENCES 138

series/0558/papers/2387/23870279.

pdf.

Martin-Vide:2002:NCS

[626] C. Martın-Vide, J. Pazos, G. Paun,and A. Rodrıguez-Paton. A newclass of symbolic abstract neural nets:Tissue P systems. Lecture Notesin Computer Science, 2387:290–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870290.htm; http:/


series/0558/papers/2387/23870290.

pdf.

Czyzowicz:2002:TSO

[627] Jurek Czyzowicz, Wojciech Fraczak,and Andrzej Pelc. Transducerswith set output. Lecture Notesin Computer Science, 2387:300–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870300.htm; http:/


series/0558/papers/2387/23870300.

pdf.

Klein:2002:SAF

[628] Andreas Klein and Martin Kutrib. Self-assembling finite automata. LectureNotes in Computer Science, 2387:310–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870310.htm; http:/


series/0558/papers/2387/23870310.

pdf.

Ilie:2002:RCW

[629] Lucian Ilie, Sheng Yu, and KaizhongZhang. Repetition complexity of words.Lecture Notes in Computer Science,2387:320–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2387/23870320.htm; http:


series/0558/papers/2387/23870320.

pdf.

Pandurangan:2002:UPC

[630] Gopal Pandurangan, Prabhakar Ragha-van, and Eli Upfal. Using PageRankto characterize Web structure. LectureNotes in Computer Science, 2387:330–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870330.htm; http:/


series/0558/papers/2387/23870330.

pdf.

Liu:2002:RBG

[631] Ding Liu and Manoj Prabhakaran.On randomized broadcasting and gos-siping in radio networks. LectureNotes in Computer Science, 2387:340–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870340.htm; http:/


series/0558/papers/2387/23870340.

pdf.

REFERENCES 139

Altman:2002:FDC

[632] Tom Altman, Yoshihide Igarashi, andKazuhiro Motegi. Fast and dependablecommunication in hyper-rings. LectureNotes in Computer Science, 2387:350–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870350.htm; http:/


series/0558/papers/2387/23870350.

pdf.

Barequet:2002:LHT

[633] Gill Barequet. The on-line Heil-bronn’s triangle problem in threeand four dimensions. Lecture Notesin Computer Science, 2387:360–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870360.htm; http:/


series/0558/papers/2387/23870360.

pdf.

Schaefer:2002:ANC

[634] Marcus Schaefer, Eric Sedgwick, andDaniel Stefankovic. Algorithms fornormal curves and surfaces. LectureNotes in Computer Science, 2387:370–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870370.htm; http:/


series/0558/papers/2387/23870370.

pdf.

Ilinkin:2002:TPD

[635] Ivaylo Ilinkin, Ravi Janardan, andMichiel Smid. Terrain polygon de-composition, with application to lay-ered manufacturing. Lecture Notesin Computer Science, 2387:381–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870381.htm; http:/


series/0558/papers/2387/23870381.

pdf.

Chen:2002:SF

[636] D. Chen, O. Eulenstein, DavidFernandez-Baca, and M. Sanderson.Supertrees by flipping. Lecture Notesin Computer Science, 2387:391–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870391.htm; http:/


series/0558/papers/2387/23870391.

pdf.

Lam:2002:STE

[637] Tak-Wah Lam, Kunihiko Sadakane,Wing-Kin Sung, and Siu-Ming Yiu. Aspace and time efficient algorithm forconstructing compressed suffix arrays.Lecture Notes in Computer Science,2387:401–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2387/23870401.htm; http:


series/0558/papers/2387/23870401.

pdf.

REFERENCES 140

Li:2002:SOR

[638] Ming Li, John Tromp, and PaulVitanyi. Sharpening Occam’s razor(extended abstract). Lecture Notesin Computer Science, 2387:411–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870411.htm; http:/


series/0558/papers/2387/23870411.

pdf.

Zhu:2002:APC

[639] Binhai Zhu. Approximating 3D pointswith cylindrical segments. LectureNotes in Computer Science, 2387:420–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870420.htm; http:/


series/0558/papers/2387/23870420.

pdf.

Ito:2002:AMP

[640] Takehiro Ito, Takao Nishizeki, andXiao Zhou. Algorithms for the mul-ticolorings of partial k-trees. LectureNotes in Computer Science, 2387:430–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870430.htm; http:/


series/0558/papers/2387/23870430.

pdf.

Ravikumar:2002:FTM

[641] B. Ravikumar. A fault-tolerant mergesorting algorithm. Lecture Notesin Computer Science, 2387:440–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870440.htm; http:/


series/0558/papers/2387/23870440.

pdf.

Brankovis:2002:CUD

[642] Ljiljana Brankovis and Jozef Siran. 2-compromise usability in 1-dimensionalstatistical databases. Lecture Notesin Computer Science, 2387:448–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870448.htm; http:/


series/0558/papers/2387/23870448.

pdf.

Chen:2002:ESC

[643] Danny Z. Chen, Shuang Luan, andJinhui Xu. An experimental studyand comparison of topological peel-ing and topological walk. LectureNotes in Computer Science, 2387:456–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870456.htm; http:/


series/0558/papers/2387/23870456.

pdf.

REFERENCES 141

Epstein:2002:LMN

[644] Leah Epstein and Lene M. Favrholdt.On-line maximizing the number ofitems packed in variable-sized bins.Lecture Notes in Computer Science,2387:467–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2387/23870467.htm; http:


series/0558/papers/2387/23870467.

pdf.

Fujita:2002:LGP

[645] Satoshi Fujita. On-line grid-packingwith a single active grid. LectureNotes in Computer Science, 2387:476–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870476.htm; http:/


series/0558/papers/2387/23870476.

pdf.

Mutzel:2002:BMO

[646] Petra Mutzel and Rene Weiskircher.Bend minimization in orthogonal draw-ings using integer programming. Lec-ture Notes in Computer Science, 2387:484–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870484.htm; http:/


series/0558/papers/2387/23870484.

pdf.

Wang:2002:CLM

[647] Biing-Feng Wang, Shan-Chyun Ku,and Yong-Hsian Hsieh. The condi-tional location of a median path. Lec-ture Notes in Computer Science, 2387:494–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870494.htm; http:/


series/0558/papers/2387/23870494.

pdf.

Ma:2002:NRT

[648] Weimin Ma, Yinfeng Xu, Jane You,James Liu, and Kanliang Wang. Newresults on the k-truck problem. Lec-ture Notes in Computer Science, 2387:504–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870504.htm; http:/


series/0558/papers/2387/23870504.

pdf.

Srinathan:2002:TEF

[649] K. Srinathan, Pranava R. Goundan,M. V. N. Ashwin Kumar, R. Nandaku-mar, and C. Pandu Rangan. Theoryof equal-flows in networks. LectureNotes in Computer Science, 2387:514–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870514.htm; http:/


series/0558/papers/2387/23870514.

pdf.

REFERENCES 142

Lin:2002:MBW

[650] Yaw-Ling Lin. Minimum back-walk-free latency problem (extended ab-stract). Lecture Notes in ComputerScience, 2387:525–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2387/23870525.



2387/23870525.pdf.

Dahllof:2002:CSA

[651] Vilhelm Dahllof, Peter Jonsson,and Magnus Wahlstrom. Count-ing satisfying assignments in 2-SAT and 3-SAT. Lecture Notesin Computer Science, 2387:535–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870535.htm; http:/


series/0558/papers/2387/23870535.

pdf.

Tomescu:2002:MNI

[652] Ioan Tomescu. On the maximum num-ber of irreducible coverings of an n-vertex graph by n − 3 cliques. Lec-ture Notes in Computer Science, 2387:544–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870544.htm; http:/


series/0558/papers/2387/23870544.

pdf.

Nickelsen:2002:RGB

[653] Arfst Nickelsen and Till Tantau. Onreachability in graphs with boundedindependence number. Lecture Notesin Computer Science, 2387:554–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870554.htm; http:/


series/0558/papers/2387/23870554.

pdf.

Fernau:2002:PE

[654] Henning Fernau. On parameter-ized enumeration. Lecture Notesin Computer Science, 2387:564–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870564.htm; http:/


series/0558/papers/2387/23870564.

pdf.

Golovkins:2002:PRA

[655] Marats Golovkins and Maksim Kravt-sev. Probabilistic reversible automataand quantum automata. LectureNotes in Computer Science, 2387:574–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870574.htm; http:/


series/0558/papers/2387/23870574.

pdf.

REFERENCES 143

Yamasaki:2002:QVD

[656] Tomohiro Yamasaki, Hirotada Kobayashi,and Hiroshi Imai. Quantum versus de-terministic counter automata. LectureNotes in Computer Science, 2387:584–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870584.htm; http:/


series/0558/papers/2387/23870584.

pdf.

Jackson:2002:QDL

[657] Jeffrey C. Jackson, Christino Tamon,and Tomoyuki Yamakami. QuantumDNF learnability revisited. LectureNotes in Computer Science, 2387:595–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2387/23870595.htm; http:/


series/0558/papers/2387/23870595.

pdf.

Anonymous:2002:AIaaax




Mukherjee:2002:PSP

[659] Neelanjan Mukherjee and SayanMukherjee. Predicting signal peptideswith support vector machines. Lec-ture Notes in Computer Science, 2388:



bibs/2388/23880001.htm; http:/


series/0558/papers/2388/23880001.

pdf.

Collobert:2002:SLL

[660] Ronan Collobert, Yoshua Bengio,and Samy Bengio. Scaling largelearning problems with hard par-allel mixtures. Lecture Notesin Computer Science, 2388:8–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880008.htm; http:/


series/0558/papers/2388/23880008.

pdf.

Navarrete:2002:GKM

[661] Pablo Navarrete and Javier Ruizdel Solar. On the generalizationof kernel machines. Lecture Notesin Computer Science, 2388:24–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880024.htm; http:/


series/0558/papers/2388/23880024.

pdf.

Tax:2002:KWO

[662] David M. J. Tax and Piotr Juszczak.Kernel whitening for one-class classi-fication. Lecture Notes in ComputerScience, 2388:40–??, 2002. CODEN

REFERENCES 144



series/0558/bibs/2388/23880040.



2388/23880040.pdf.

Dong:2002:FST

[663] Jian xiong Dong, Adam Krzyzak,and Ching Y. Suen. A fast SVMtraining algorithm. Lecture Notesin Computer Science, 2388:53–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880053.htm; http:/


series/0558/papers/2388/23880053.

pdf.

Fumera:2002:SVM

[664] Giorgio Fumera and Fabio Roli. Sup-port vector machines with embed-ded reject option. Lecture Notesin Computer Science, 2388:68–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880068.htm; http:/


series/0558/papers/2388/23880068.

pdf.

Barla:2002:IK

[665] Annalisa Barla, Emanuele Franceschi,Francesca Odone, and AlessandroVerri. Image kernels. Lecture Notesin Computer Science, 2388:83–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2388/23880083.htm; http:/


series/0558/papers/2388/23880083.

pdf.

Caputo:2002:CCS

[666] B. Caputo, Gy. Dorko, and H. Nie-mann. Combining color and shapeinformation for appearance-based ob-ject recognition using ultrametric spinglass-markov random fields. LectureNotes in Computer Science, 2388:97–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880097.htm; http:/


series/0558/papers/2388/23880097.

pdf.

Nakajima:2002:MTE

[667] Chikahito Nakajima and Massimil-iano Pontil. Maintenance trainingof electric power facilities using ob-ject recognition by SVM. LectureNotes in Computer Science, 2388:112–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880112.htm; http:/


series/0558/papers/2388/23880112.

pdf.

Genov:2002:KSV

[668] Roman Genov and Gert Cauwen-berghs. Kerneltron: Support vec-tor ‘machine’ in silicon. LectureNotes in Computer Science, 2388:120–

REFERENCES 145



bibs/2388/23880120.htm; http:/


series/0558/papers/2388/23880120.

pdf.

Bileschi:2002:ACB

[669] Stanley M. Bileschi and BerndHeisele. Advances in component-based face detection. Lecture Notesin Computer Science, 2388:135–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880135.htm; http:/


series/0558/papers/2388/23880135.

pdf.

Walawalkar:2002:SVL

[670] L. Walawalkar, Mohammad Yeasin,Anand M. Narasimhamurthy, and Ra-jeev Sharma. Support vector learn-ing for gender classification using audioand visual cues: A comparison. Lec-ture Notes in Computer Science, 2388:144–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880144.htm; http:/


series/0558/papers/2388/23880144.

pdf.

Chang:2002:ANT

[671] Ming-Wei Chang, Chih-Jen Lin, andRuby C. Weng. Analysis of non-stationary time series using sup-

port vector machines. Lecture Notesin Computer Science, 2388:160–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880160.htm; http:/


series/0558/papers/2388/23880160.

pdf.

Sekhar:2002:RCV

[672] C. Chandra Sekhar, Kazuya Takeda,and Fumitada Itakura. Recognition ofconsonant-vowel (CV) units of speechin a broadcast news corpus usingsupport vector machines. LectureNotes in Computer Science, 2388:171–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880171.htm; http:/


series/0558/papers/2388/23880171.

pdf.

Fugate:2002:ADE

[673] Mike Fugate and James R. Gat-tiker. Anomaly detection en-hanced classification in computer in-trusion detection. Lecture Notesin Computer Science, 2388:186–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880186.htm; http:/


series/0558/papers/2388/23880186.

pdf.

REFERENCES 146

Milanova:2002:SCK

[674] Mariofanna Milanova, Tomasz G.Smolinski, Grzegorz M. Boratyn,Jacek M. Zurada, and Andrzej Wro-bel. Sparse correlation kernel analy-sis and evolutionary algorithm-basedmodeling of the sensory activity withinthe rat’s barrel cortex. Lecture Notesin Computer Science, 2388:198–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880198.htm; http:/


series/0558/papers/2388/23880198.

pdf.

Byun:2002:ASV

[675] Hyeran Byun and Seong-Whan Lee.Applications of support vector ma-chines for pattern recognition: A sur-vey. Lecture Notes in Computer Sci-ence, 2388:213–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2388/23880213.



2388/23880213.pdf.

Kitamoto:2002:TAD

[676] Asanobu Kitamoto. Typhoon analysisand data mining with kernel methods.Lecture Notes in Computer Science,2388:237–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2388/23880237.htm; http:


series/0558/papers/2388/23880237.

pdf.

Smeraldi:2002:SVF

[677] Fabrizio Smeraldi, Josef Bigun, andWulfram Gerstner. Support vectorfeatures and the role of dimension-ality in face authentication. LectureNotes in Computer Science, 2388:249–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880249.htm; http:/


series/0558/papers/2388/23880249.

pdf.

Ma:2002:FDB

[678] Yong Ma and Xiaoqing Ding. Facedetection based on cost-sensitive sup-port vector machines. Lecture Notesin Computer Science, 2388:260–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880260.htm; http:/


series/0558/papers/2388/23880260.

pdf.

Kang:2002:RTP

[679] Seonghoon Kang, Hyeran Byun,and Seong-Whan Lee. Real-timepedestrian detection using supportvector machines. Lecture Notesin Computer Science, 2388:268–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880268.htm; http:/

REFERENCES 147


series/0558/papers/2388/23880268.

pdf.

Chakrabartty:2002:FDK

[680] Shantanu Chakrabartty and GertCauwenberghs. Forward decoding ker-nel machines: A hybrid HMM/SVMapproach to sequence recognition. Lec-ture Notes in Computer Science, 2388:278–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880278.htm; http:/


series/0558/papers/2388/23880278.

pdf.

Kim:2002:CTB

[681] Kwang In Kim, Keechul Jung, andJin Hyung Kim. Color texture-basedobject detection: An application tolicense plate localization. LectureNotes in Computer Science, 2388:293–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880293.htm; http:/


series/0558/papers/2388/23880293.

pdf.

Ruping:2002:SVM

[682] Stefan Ruping. Support vector ma-chines in relational databases. LectureNotes in Computer Science, 2388:310–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880310.htm; http:/


series/0558/papers/2388/23880310.

pdf.

Li:2002:MCS

[683] Zeyu Li, Shiwei Tang, and ShuichengYan. Multi-class SVM classifier basedon pairwise coupling. Lecture Notesin Computer Science, 2388:321–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880321.htm; http:/


series/0558/papers/2388/23880321.

pdf.

Huang:2002:FRU

[684] Jennifer Huang, Volker Blanz, andBernd Heisele. Face recognition us-ing component-based SVM classifica-tion and morphable models. LectureNotes in Computer Science, 2388:334–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880334.htm; http:/


series/0558/papers/2388/23880334.

pdf.

Li:2002:NCR

[685] Jianmin Li, Bo Zhang, and FuzongLin. A new cache replacement al-gorithm in SMO. Lecture Notesin Computer Science, 2388:342–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880342.htm; http:/

REFERENCES 148


series/0558/papers/2388/23880342.

pdf.

Ayat:2002:OSK

[686] Nedjem-Eddine Ayat, Mohamed Cheriet,and Ching Y. Suen. Optimization ofthe SVM kernels using an empiricalerror minimization scheme. LectureNotes in Computer Science, 2388:354–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880354.htm; http:/


series/0558/papers/2388/23880354.

pdf.

Xi:2002:FDB

[687] Dihua Xi and Seong-Whan Lee.Face detection based on supportvector machines. Lecture Notesin Computer Science, 2388:370–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880370.htm; http:/


series/0558/papers/2388/23880370.

pdf.

Johansson:2002:DWC

[688] Bjorn Johansson and Fredrik Kahl. De-tecting windows in city scenes. LectureNotes in Computer Science, 2388:388–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880388.htm; http:/


series/0558/papers/2388/23880388.

pdf.

Kim:2002:SVM

[689] Hyun-Chul Kim, Shaoning Pang,Hong-Mo Je, Daijin Kim, and Sung-Yang Bang. Support vector ma-chine ensemble with bagging. LectureNotes in Computer Science, 2388:397–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880397.htm; http:/


series/0558/papers/2388/23880397.

pdf.

Santos:2002:CSP

[690] Eulanda Miranda dos Santos andHerman Martins Gomes. A com-parative study of polynomial ker-nel SVM applied to appearance-basedobject recognition. Lecture Notesin Computer Science, 2388:408–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2388/23880408.htm; http:/


series/0558/papers/2388/23880408.

pdf.

Anonymous:2002:AIaaay




REFERENCES 149

Sproat:2002:WTS

[692] Richard Sproat. WordsEye: A text-to-scene conversion system. LectureNotes in Computer Science, 2389:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890001.htm; http:/


series/0558/papers/2389/23890001.

pdf.

Mitkov:2002:AAR

[693] Ruslan Mitkov. Automatic anaphoraresolution: Limits, impediments,and ways forward. Lecture Notesin Computer Science, 2389:3–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890003.htm; http:/


series/0558/papers/2389/23890003.

pdf.

Cucchiarelli:2002:FBW

[694] Alessandro Cucchiarelli and Paola Ve-lardi. Feature-based WSD: Whywe are at a dead-end. LectureNotes in Computer Science, 2389:5–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890005.htm; http:/


series/0558/papers/2389/23890005.

pdf.

Suarez:2002:IFS

[695] Armando Suarez and Manuel Palo-mar. Improving feature selectionfor maximum entropy-based wordsense disambiguation. Lecture Notesin Computer Science, 2389:15–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890015.htm; http:/


series/0558/papers/2389/23890015.

pdf.

Bolshakov:2002:HBR

[696] Igor A. Bolshakov and Alexander Gel-bukh. Heuristics-based replenishmentof collocation databases. LectureNotes in Computer Science, 2389:25–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890025.htm; http:/


series/0558/papers/2389/23890025.

pdf.

Constant:2002:ALP

[697] Matthieu Constant. On the analy-sis of locative phrases with graphsand lexicon-grammar: The classi-fier/proper noun pairing. LectureNotes in Computer Science, 2389:33–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890033.htm; http:/


series/0558/papers/2389/23890033.

pdf.

REFERENCES 150

Oliveira:2002:RPO

[698] Miguel Oliveira. The role of pause oc-currence and pause duration in the sig-naling of narrative structure. LectureNotes in Computer Science, 2389:43–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890043.htm; http:/


series/0558/papers/2389/23890043.

pdf.

Martinez-Barco:2002:GBS

[699] Patricio Martınez-Barco, Estela Sa-quete, and Rafael Munoz. A grammar-based system to solve temporal ex-pressions in Spanish texts. LectureNotes in Computer Science, 2389:53–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890053.htm; http:/


series/0558/papers/2389/23890053.

pdf.

Munoz:2002:SIA

[700] R. Munoz, M. Saiz-Noeda, andA. Montoyo. Semantic informa-tion in anaphora resolution. LectureNotes in Computer Science, 2389:63–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890063.htm; http:/


series/0558/papers/2389/23890063.

pdf.

Chung:2002:TTI

[701] Gohsran Chung. A type of transi-tive inalienable possession construc-tion in korean. Lecture Notesin Computer Science, 2389:71–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890071.htm; http:/


series/0558/papers/2389/23890071.

pdf.

Bogacki:2002:TNP

[702] Krzysztof Bogacki. The treatment ofnumbers in polish by graphs. LectureNotes in Computer Science, 2389:75–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890075.htm; http:/


series/0558/papers/2389/23890075.

pdf.

Coheur:2002:SST

[703] Luısa Coheur and Nuno Mamede.From syntax to semantics: Takingadvantages of 5P. Lecture Notesin Computer Science, 2389:79–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890079.htm; http:/


series/0558/papers/2389/23890079.

pdf.

REFERENCES 151

Cori:2002:PD

[704] Marcel Cori. Processing discontinu-ity. Lecture Notes in Computer Science,2389:83–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2389/23890083.htm; http:


series/0558/papers/2389/23890083.

pdf.

SantAnna:2002:RDA

[705] Victor Sant’Anna and Vera L. S.de Lima. Resolution of demon-strative anaphoric references in Por-tuguese written texts. Lecture Notesin Computer Science, 2389:87–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890087.htm; http:/


series/0558/papers/2389/23890087.

pdf.

Caseiro:2002:LVC

[706] Diamantino Caseiro and Isabel Tran-coso. Large vocabulary continu-ous speech recognition using weightedfinite-state transducers. Lecture Notesin Computer Science, 2389:91–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890091.htm; http:/


series/0558/papers/2389/23890091.

pdf.

Souto:2002:BLM

[707] Nuno Souto, Hugo Meinedo, andJoao P. Neto. Building languagemodels for continuous speech recog-nition systems. Lecture Notesin Computer Science, 2389:101–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890101.htm; http:/


series/0558/papers/2389/23890101.

pdf.

Ellouze:2002:RIE

[708] Mariem Ellouze and Abdelmajid BenHamadou. Relevant information ex-traction driven with rhetorical schemasto summarize scientific papers. Lec-ture Notes in Computer Science, 2389:111–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890111.htm; http:/


series/0558/papers/2389/23890111.

pdf.

Giorgetti:2002:MAS

[709] Daniela Giorgetti, Irina Prodanof,and Fabrizio Sebastiani. Map-ping an automated survey codingtask into a probabilistic text cate-gorization framework. Lecture Notesin Computer Science, 2389:115–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890115.htm; http:/


REFERENCES 152

series/0558/papers/2389/23890115.

pdf.

Koehn:2002:CMM

[710] Philipp Koehn. Combining multi-class maximum entropy text classifierswith neural network voting. LectureNotes in Computer Science, 2389:125–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890125.htm; http:/


series/0558/papers/2389/23890125.

pdf.

Baptista:2002:CTA

[711] Jorge Baptista and Dolors Catala Gui-tart. Compound temporal adverbs inPortuguese and in Spanish. LectureNotes in Computer Science, 2389:133–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890133.htm; http:/


series/0558/papers/2389/23890133.

pdf.

Grass:2002:DMD

[712] Thierry Grass, Denis Maurel, andOdile Piton. Description of a multi-lingual database of proper names. Lec-ture Notes in Computer Science, 2389:137–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890137.htm; http:/


series/0558/papers/2389/23890137.

pdf.

Freitas:2002:PSI

[713] Diamantino Freitas, Antonio Moura,Daniela Braga, Helder Ferreira,Joao Paulo Teixeira, Maria Joao Bar-ros, Paulo Gouveia, and Vagner Latsch.A project of speech input and outputin an E-commerce application. LectureNotes in Computer Science, 2389:141–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890141.htm; http:/


series/0558/papers/2389/23890141.

pdf.

Bucher:2002:ARF

[714] Kerstin Bucher, Michael Knorr, andBernd Ludwig. Ambiguity reports forflexible dialog management. LectureNotes in Computer Science, 2389:151–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890151.htm; http:/


series/0558/papers/2389/23890151.

pdf.

Abreu:2002:NLD

[715] Salvador Abreu, Paulo Quaresma, LuisQuintano, and Irene Rodrigues. Anatural language dialogue manager foraccessing databases. Lecture Notesin Computer Science, 2389:161–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 153


bibs/2389/23890161.htm; http:/


series/0558/papers/2389/23890161.

pdf.

Silveira:2002:HCH

[716] Milene Silveira, Maria Carmelita Dias,and Violeta Quental. Helping thecomposition of help contents. LectureNotes in Computer Science, 2389:171–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890171.htm; http:/


series/0558/papers/2389/23890171.

pdf.

Cardoso:2002:MTB

[717] Pedro Cardoso, Luis Flores, ThibaultLanglois, and Joao Neto. Meteo: Atelephone-based Portuguese conversa-tion system in weather domain. Lec-ture Notes in Computer Science, 2389:175–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890175.htm; http:/


series/0558/papers/2389/23890175.

pdf.

Hagen:2002:CRM

[718] Astrid Hagen. Concluding remarkson multi-band and multi-stream re-search for noise-robust ASR. LectureNotes in Computer Science, 2389:179–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890179.htm; http:/


series/0558/papers/2389/23890179.

pdf.

Dias-da-Silva:2002:GDB

[719] Bento C. Dias da Silva, Mirna F.de Oliveira, and Helio R. de Moraes.Groundwork for the development of theBrazilian Portuguese Wordnet. LectureNotes in Computer Science, 2389:189–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890189.htm; http:/


series/0558/papers/2389/23890189.

pdf.

Hagege:2002:LPB

[720] Caroline Hagege, Agnes Sandor, andAnne Schiller. Linguistic processingof biomedical texts. Lecture Notesin Computer Science, 2389:197–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890197.htm; http:/


series/0558/papers/2389/23890197.

pdf.

Santos:2002:DSD

[721] Diana Santos. DISPARA, a sys-tem for distributing parallel cor-pora on the Web. Lecture Notesin Computer Science, 2389:209–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 154


bibs/2389/23890209.htm; http:/


series/0558/papers/2389/23890209.

pdf.

Paulo:2002:UMS

[722] Joana Lucio Paulo, Margarita Cor-reia, Nuno J. Mamede, and CarolineHagege. Using morphological, syntac-tical, and statistical information forautomatic term acquisition. LectureNotes in Computer Science, 2389:219–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890219.htm; http:/


series/0558/papers/2389/23890219.

pdf.

Carvalho:2002:CLU

[723] Paula Carvalho, Cristina Mota, andElisabete Ranchhod. Complex lex-ical units and automata. LectureNotes in Computer Science, 2389:229–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890229.htm; http:/


series/0558/papers/2389/23890229.

pdf.

Makagonov:2002:CEF

[724] Pavel Makagonov and Mikhail Alexan-drov. Constructing empirical for-mulas for testing word similarityby the inductive method of modelself-organization. Lecture Notesin Computer Science, 2389:239–??,



bibs/2389/23890239.htm; http:/


series/0558/papers/2389/23890239.

pdf.

Vieira:2002:MCA

[725] Renata Vieira, Susanne Salmon-Alt,and Emmanuel Schang. Multilin-gual corpora annotation for process-ing definite descriptions. LectureNotes in Computer Science, 2389:249–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890249.htm; http:/


series/0558/papers/2389/23890249.

pdf.

Gelbukh:2002:RDM

[726] Alexander Gelbukh, Grigori Sidorov,and Adolfo Guzman-Arenas. Rela-tional data model in document hi-erarchical indexing. Lecture Notesin Computer Science, 2389:259–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2389/23890259.htm; http:/


series/0558/papers/2389/23890259.

pdf.

Pardo:2002:DRA

[727] Thiago Alexandre Salgueiro Pardo andLucia Helena Machado Rino. DM-Summ: Review and assessment. Lec-

REFERENCES 155



bibs/2389/23890263.htm; http:/


series/0558/papers/2389/23890263.

pdf.

Anonymous:2002:AIaaaz




Shankar:2002:LEP

[729] Natarajan Shankar. Little en-gines of proof. Lecture Notesin Computer Science, 2391:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910001.htm; http:/


series/0558/papers/2391/23910001.

pdf.

Legeard:2002:ABT

[730] Bruno Legeard, Fabien Peureux, andMark Utting. Automated bound-ary testing from Z and B. LectureNotes in Computer Science, 2391:21–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910021.htm; http:/


series/0558/papers/2391/23910021.

pdf.

Ratsaby:2002:ICA

[731] Gil Ratsaby, Baruch Sterin, andShmuel Ur. Improvements in cov-erability analysis. Lecture Notesin Computer Science, 2391:41–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910041.htm; http:/


series/0558/papers/2391/23910041.

pdf.

Burguillo-Rial:2002:HDT

[732] Juan C. Burguillo-Rial, Manuel J.Fernandez-Iglesias, Francisco J. Gonzalez-Castano, and Martın Llamas-Nistal.Heuristic-driven test case selectionfrom formal specifications. A casestudy. Lecture Notes in ComputerScience, 2391:57–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2391/23910057.



2391/23910057.pdf.

Bourdonov:2002:UTS

[733] Igor B. Bourdonov, Alexander S. Kos-satchev, Victor V. Kuliamin, andAlexander K. Petrenko. UniTesKtest suite architecture. Lecture Notesin Computer Science, 2391:77–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 156

bibs/2391/23910077.htm; http:/


series/0558/papers/2391/23910077.

pdf.

Oheimb:2002:HLN

[734] David von Oheimb and Tobias Nip-kow. Hoare logic for NanoJava:Auxiliary variables, side effects, andvirtual methods revisited. LectureNotes in Computer Science, 2391:89–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910089.htm; http:/


series/0558/papers/2391/23910089.

pdf.

Bicarregui:2002:DR

[735] Juan C. Bicarregui. Do not read this.Lecture Notes in Computer Science,2391:106–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2391/23910106.htm; http:


series/0558/papers/2391/23910106.

pdf.

Jorgensen:2002:SMB

[736] Niels Jørgensen. Safeness of make-based incremental recompilation. Lec-ture Notes in Computer Science, 2391:126–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910126.htm; http:/


series/0558/papers/2391/23910126.

pdf.

Barner:2002:AAD

[737] Sharon Barner, Shoham Ben-David,Anna Gringauze, Baruch Sterin, andYaron Wolfsthal. An algorithmic ap-proach to design exploration. LectureNotes in Computer Science, 2391:146–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910146.htm; http:/


series/0558/papers/2391/23910146.

pdf.

Mota:2002:MAC

[738] Alexandre Mota, Paulo Borba, andAugusto Sampaio. Mechanical ab-straction of CSPZ processes. LectureNotes in Computer Science, 2391:163–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910163.htm; http:/


series/0558/papers/2391/23910163.

pdf.

Arts:2002:VEC

[739] Thomas Arts, Clara Benac Earle, andJohn Derrick. Verifying Erlang code:A resource locker case-study. LectureNotes in Computer Science, 2391:184–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910184.htm; http:/


REFERENCES 157

series/0558/papers/2391/23910184.

pdf.

Huber:2002:TIM

[740] Michael Huber and Steve King. To-wards an integrated model checkerfor railway signalling data. LectureNotes in Computer Science, 2391:204–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910204.htm; http:/


series/0558/papers/2391/23910204.

pdf.

Hall:2002:CCI

[741] Anthony Hall. Correctness by construc-tion: Integrating formality into a com-mercial development process. LectureNotes in Computer Science, 2391:224–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910224.htm; http:/


series/0558/papers/2391/23910224.

pdf.

Marinov:2002:VVF

[742] Darko Marinov and Sarfraz Khur-shid. VAlloy — virtual functionsmeet a relational language. LectureNotes in Computer Science, 2391:234–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910234.htm; http:/


series/0558/papers/2391/23910234.

pdf.

Rusu:2002:VUT

[743] Vlad Rusu. Verification using testgeneration techniques. Lecture Notesin Computer Science, 2391:252–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910252.htm; http:/


series/0558/papers/2391/23910252.

pdf.

Catano:2002:FSS

[744] Nestor Catano and Marieke Huis-man. Formal specification and staticchecking of Gemplus’ electronic purseusing ESC/Java. Lecture Notesin Computer Science, 2391:272–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910272.htm; http:/


series/0558/papers/2391/23910272.

pdf.

Casset:2002:DEV

[745] Ludovic Casset. Development of anembedded verifier for Java card bytecode using formal methods. LectureNotes in Computer Science, 2391:290–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910290.htm; http:/


REFERENCES 158

series/0558/papers/2391/23910290.

pdf.

Backes:2002:DCS

[746] Michael Backes, Christian Jacobi, andBirgit Pfitzmann. Deriving crypto-graphically sound implementations us-ing composition and formally ver-ified bisimulation. Lecture Notesin Computer Science, 2391:310–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910310.htm; http:/


series/0558/papers/2391/23910310.

pdf.

Pahl:2002:IAD

[747] Claus Pahl. Interference analysisfor dependable systems using refine-ment and abstraction. Lecture Notesin Computer Science, 2391:330–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910330.htm; http:/


series/0558/papers/2391/23910330.

pdf.

Henderson:2002:FCV

[748] N. Henderson and S. E. Paynter.The formal classification and verifica-tion of simpson’s 4-slot asynchronouscommunication mechanism. LectureNotes in Computer Science, 2391:350–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910350.htm; http:/


series/0558/papers/2391/23910350.

pdf.

Fidge:2002:TAA

[749] C. J. Fidge. Timing analysis of assem-bler code control-flow paths. LectureNotes in Computer Science, 2391:370–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910370.htm; http:/


series/0558/papers/2391/23910370.

pdf.

Cengarle:2002:TOR

[750] Marıa Victoria Cengarle and Alexan-der Knapp. Towards OCL/RT. Lec-ture Notes in Computer Science, 2391:390–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910390.htm; http:/


series/0558/papers/2391/23910390.

pdf.

Garavel:2002:CFV

[751] Hubert Garavel and Holger Her-manns. On combining functionalverification and performance evalu-ation using CADP. Lecture Notesin Computer Science, 2391:410–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910410.htm; http:/


REFERENCES 159

series/0558/papers/2391/23910410.

pdf.

Basin:2002:NSC

[752] David Basin. The next 700synthesis calculi. Lecture Notesin Computer Science, 2391:430–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910430.htm; http:/


series/0558/papers/2391/23910430.

pdf.

Whalen:2002:SCC

[753] Michael Whalen, Johann Schumann,and Bernd Fischer. Synthesiz-ing certified code. Lecture Notesin Computer Science, 2391:431–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910431.htm; http:/


series/0558/papers/2391/23910431.

pdf.

Sampaio:2002:RC

[754] Augusto Sampaio, Jim Woodcock, andAna Cavalcanti. Refinement in Circus .Lecture Notes in Computer Science,2391:451–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2391/23910451.htm; http:


series/0558/papers/2391/23910451.

pdf.

Cavalcanti:2002:FSD

[755] Ana Cavalcanti and David A. Nau-mann. Forward simulation for datarefinement of classes. Lecture Notesin Computer Science, 2391:471–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910471.htm; http:/


series/0558/papers/2391/23910471.

pdf.

Wildman:2002:FBP

[756] Luke Wildman. A formal basis for aprogram compilation proof tool. Lec-ture Notes in Computer Science, 2391:491–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910491.htm; http:/


series/0558/papers/2391/23910491.

pdf.

Firley:2002:PDA

[757] Thomas Firley and Ursula Goltz. Prop-erty dependent abstraction of controlstructure for software verification. Lec-ture Notes in Computer Science, 2391:511–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910511.htm; http:/


series/0558/papers/2391/23910511.

pdf.

REFERENCES 160

Ioustinova:2002:COS

[758] Natalia Ioustinova, Natalia Sidorova,and Martin Steffen. Closing openSDL-systems for model checking withDTSpin. Lecture Notes in ComputerScience, 2391:531–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2391/23910531.



2391/23910531.pdf.

Kristensen:2002:GSL

[759] Lars Michael Kristensen and ThomasMailund. A generalised sweep-linemethod for safety properties. LectureNotes in Computer Science, 2391:549–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910549.htm; http:/


series/0558/papers/2391/23910549.

pdf.

Treharne:2002:SUD

[760] Helen Treharne. Supplementing a UMLdevelopment process with B. LectureNotes in Computer Science, 2391:568–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910568.htm; http:/


series/0558/papers/2391/23910568.

pdf.

Dong:2002:SWE

[761] Jin Song Dong, Jing Sun, and HaiWang. Semantic Web for extend-ing and linking formalisms. LectureNotes in Computer Science, 2391:587–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910587.htm; http:/


series/0558/papers/2391/23910587.

pdf.

Umedu:2002:LDW

[762] Takaaki Umedu, Yoshiki Terashima,Keiichi Yasumoto, Akio Nakata, TeruoHigashino, and Kenichi Taniguchi. Alanguage for describing wireless mo-bile applications with dynamic es-tablishment of multi-way synchro-nization channels. Lecture Notesin Computer Science, 2391:607–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2391/23910607.htm; http:/


series/0558/papers/2391/23910607.

pdf.

Anonymous:2002:AIaaaaa




REFERENCES 161

Horrocks:2002:RED

[764] Ian Horrocks. Reasoning with ex-pressive description logics: The-ory and practice. Lecture Notesin Computer Science, 2392:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920001.htm; http:/


series/0558/papers/2392/23920001.

pdf.

Pan:2002:BBD

[765] Guoqiang Pan, Ulrike Sattler, andMoshe Y. Vardi. BDD-based de-cision procedures for K. LectureNotes in Computer Science, 2392:16–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920016.htm; http:/


series/0558/papers/2392/23920016.

pdf.

Bernard:2002:TLP

[766] Andrew Bernard and Peter Lee. Tem-poral logic for proof-carrying code. Lec-ture Notes in Computer Science, 2392:31–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920031.htm; http:/


series/0558/papers/2392/23920031.

pdf.

Schneck:2002:GAM

[767] Robert R. Schneck and George C.Necula. A gradual approach toa more trustworthy, yet scalable,proof-carrying code. Lecture Notesin Computer Science, 2392:47–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920047.htm; http:/


series/0558/papers/2392/23920047.

pdf.

Strecker:2002:FVJ

[768] Martin Strecker. Formal verificationof a Java compiler in isabelle. LectureNotes in Computer Science, 2392:63–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920063.htm; http:/


series/0558/papers/2392/23920063.

pdf.

Egly:2002:ELL

[769] Uwe Egly. Embedding Lax logicinto intuitionistic logic. LectureNotes in Computer Science, 2392:78–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920078.htm; http:/


series/0558/papers/2392/23920078.

pdf.

REFERENCES 162

Larchey-Wendling:2002:CPS

[770] Dominique Larchey-Wendling. Com-bining proof-search and counter-model construction for deciding Godel-dummett logic. Lecture Notesin Computer Science, 2392:94–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920094.htm; http:/


series/0558/papers/2392/23920094.

pdf.

Galmiche:2002:CBP

[771] Didier Galmiche and Daniel Mery.Connection-based proof search inpropositional BI logic. Lecture Notesin Computer Science, 2392:111–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920111.htm; http:/


series/0558/papers/2392/23920111.

pdf.

Moller:2002:DLS

[772] Jesper B. Møller. DDDLIB: A li-brary for solving quantified differ-ence inequalities. Lecture Notesin Computer Science, 2392:129–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920129.htm; http:/


series/0558/papers/2392/23920129.

pdf.

Hurd:2002:LSI

[773] Joe Hurd. An LCF-style interface be-tween HOL and first-order logic. Lec-ture Notes in Computer Science, 2392:134–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920134.htm; http:/


series/0558/papers/2392/23920134.

pdf.

Zimmer:2002:SDM

[774] Jurgen Zimmer and Michael Kohlhase.System description: The MathWebsoftware bus for distributed math-ematical reasoning. Lecture Notesin Computer Science, 2392:139–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920139.htm; http:/


series/0558/papers/2392/23920139.

pdf.

Siekmann:2002:PD

[775] Jorg Siekmann, Christoph Benzmuller,Vladimir Brezhnev, Lassaad Cheikhrouhou,Armin Fiedler, Andreas Franke, Hel-mut Horacek, Michael Kohlhase, An-dreas Meier, Erica Melis, MarkusMoschner, Immanuel Normann, Mar-tin Pollet, Volker Sorge, CarstenUllrich, Claus-Peter Wirth, andJurgen Zimmer. Proof develop-ment with ΩMEGA. Lecture Notesin Computer Science, 2392:144–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 163


bibs/2392/23920144.htm; http:/


series/0558/papers/2392/23920144.

pdf.

Jamnik:2002:LSD

[776] Mateja Jamnik, Manfred Kerber,and Martin Pollet. LearnΩ matic:System description. Lecture Notesin Computer Science, 2392:150–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920150.htm; http:/


series/0558/papers/2392/23920150.

pdf.

Areces:2002:HDR

[777] Carlos Areces and Juan Heguiabehere.HyLoRes 1.0 : Direct resolutionfor hybrid logics. Lecture Notesin Computer Science, 2392:156–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920156.htm; http:/


series/0558/papers/2392/23920156.

pdf.

Goldberg:2002:TSC

[778] Eugene Goldberg. Testing satisfia-bility of CNF formulas by comput-ing a stable set of points. LectureNotes in Computer Science, 2392:161–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920161.htm; http:/


series/0558/papers/2392/23920161.

pdf.

Tour:2002:NSH

[779] Thierry Boy de la Tour. A note onsymmetry heuristics in SEM. LectureNotes in Computer Science, 2392:181–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920181.htm; http:/


series/0558/papers/2392/23920181.

pdf.

Audemard:2002:SBA

[780] Gilles Audemard, Piergiorgio Bertoli,Alessandro Cimatti, Artur Korni lowicz,and Roberto Sebastiani. A SATbased approach for solving formu-las over Boolean and linear mathe-matical propositions. Lecture Notesin Computer Science, 2392:195–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920195.htm; http:/


series/0558/papers/2392/23920195.

pdf.

Ahrendt:2002:DSE

[781] Wolfgang Ahrendt. Deductive searchfor errors in free data type specifica-tions using model generation. LectureNotes in Computer Science, 2392:211–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 164


bibs/2392/23920211.htm; http:/


series/0558/papers/2392/23920211.

pdf.

Audemard:2002:RSF

[782] Gilles Audemard and Belaid Ben-hamou. Reasoning by symme-try and function ordering in finitemodel generation. Lecture Notesin Computer Science, 2392:226–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920226.htm; http:/


series/0558/papers/2392/23920226.

pdf.

Gramlich:2002:AAH

[783] Bernhard Gramlich and Reinhard Pich-ler. Algorithmic aspects of Her-brand models represented by groundatoms with ground equations. LectureNotes in Computer Science, 2392:241–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920241.htm; http:/


series/0558/papers/2392/23920241.

pdf.

Georgieva:2002:NCC

[784] Lilia Georgieva, Ullrich Hustadt, andRenate A. Schmidt. A new clausal classdecidable by hyperresolution. LectureNotes in Computer Science, 2392:260–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2392/23920260.htm; http:/


series/0558/papers/2392/23920260.

pdf.

Weidenbach:2002:V

[785] Christoph Weidenbach, Uwe Brahm,Thomas Hillenbrand, Enno Keen,Christian Theobald, and DaliborTopic. SPASS Version 2.0. LectureNotes in Computer Science, 2392:275–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920275.htm; http:/


series/0558/papers/2392/23920275.

pdf.

Schulz:2002:SDG

[786] Stephan Schulz and Geoff Sutcliffe.System description: GrAnDe 1.0. Lec-ture Notes in Computer Science, 2392:280–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920280.htm; http:/


series/0558/papers/2392/23920280.

pdf.

Colton:2002:HPT

[787] Simon Colton. The HR program fortheorem generation. Lecture Notesin Computer Science, 2392:285–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 165

bibs/2392/23920285.htm; http:/


series/0558/papers/2392/23920285.

pdf.

Whalen:2002:ACC

[788] Michael Whalen, Johann Schumann,and Bernd Fischer. AutoBayes/CC — combining program synthe-sis with automatic code certification— system description. Lecture Notesin Computer Science, 2392:290–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920290.htm; http:/


series/0558/papers/2392/23920290.

pdf.

Zhang:2002:QEB

[789] Lintao Zhang and Sharad Malik.The quest for efficient Boolean sat-isfiability solvers. Lecture Notesin Computer Science, 2392:295–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920295.htm; http:/


series/0558/papers/2392/23920295.

pdf.

Borralleras:2002:RPO

[790] Cristina Borralleras, Salvador Lucas,and Albert Rubio. Recursive path or-derings can be context-sensitive. Lec-ture Notes in Computer Science, 2392:314–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920314.htm; http:/


series/0558/papers/2392/23920314.

pdf.

Ganzinger:2002:SL

[791] Harald Ganzinger. Shostak light. Lec-ture Notes in Computer Science, 2392:332–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920332.htm; http:/


series/0558/papers/2392/23920332.

pdf.

Ford:2002:FVC

[792] Jonathan Ford and Natarajan Shankar.Formal verification of a combinationdecision procedure. Lecture Notesin Computer Science, 2392:347–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920347.htm; http:/


series/0558/papers/2392/23920347.

pdf.

Zarba:2002:CMI

[793] Calogero G. Zarba. Combining mul-tisets with integers. Lecture Notesin Computer Science, 2392:363–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920363.htm; http:/


REFERENCES 166

series/0558/papers/2392/23920363.

pdf.

Paulson:2002:RTS

[794] Lawrence C. Paulson. The reflec-tion theorem: A study in meta-theoretic reasoning. Lecture Notesin Computer Science, 2392:377–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920377.htm; http:/


series/0558/papers/2392/23920377.

pdf.

Stump:2002:FPC

[795] Aaron Stump and David L. Dill.Faster proof checking in the edin-burgh logical framework. LectureNotes in Computer Science, 2392:392–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920392.htm; http:/


series/0558/papers/2392/23920392.

pdf.

Brown:2002:SSV

[796] Chad E. Brown. Solving for set vari-ables in higher-order theorem proving.Lecture Notes in Computer Science,2392:408–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2392/23920408.htm; http:


series/0558/papers/2392/23920408.

pdf.

Kupferman:2002:CGS

[797] Orna Kupferman, Ulrike Sattler, andMoshe Y. Vardi. The complexityof the graded µ-calculus. LectureNotes in Computer Science, 2392:423–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920423.htm; http:/


series/0558/papers/2392/23920423.

pdf.

Moura:2002:LTP

[798] Leonardo de Moura, Harald Rueß,and Maria Sorea. Lazy theoremproving for bounded model check-ing over infinite domains. LectureNotes in Computer Science, 2392:438–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920438.htm; http:/


series/0558/papers/2392/23920438.

pdf.

Bofill:2002:WFS

[799] Miquel Bofill and Albert Rubio. Well-foundedness is sufficient for complete-ness of ordered paramodulation. Lec-ture Notes in Computer Science, 2392:456–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920456.htm; http:/


series/0558/papers/2392/23920456.

pdf.

REFERENCES 167

Lynch:2002:BSM

[800] Christopher Lynch and BarbaraMorawska. Basic syntactic mutation.Lecture Notes in Computer Science,2392:471–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2392/23920471.htm; http:


series/0558/papers/2392/23920471.

pdf.

Hillenbrand:2002:NWA

[801] Thomas Hillenbrand and BerndLochner. The next W ALD-MEISTER loop. Lecture Notesin Computer Science, 2392:486–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920486.htm; http:/


series/0558/papers/2392/23920486.

pdf.

Andreoli:2002:FPN

[802] Jean Marc Andreoli. Focussingproof-net construction as a mid-dleware paradigm. Lecture Notesin Computer Science, 2392:501–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920501.htm; http:/


series/0558/papers/2392/23920501.

pdf.

Baaz:2002:PARb

[803] Matthias Baaz. Proof analy-sis by resolution. Lecture Notesin Computer Science, 2392:517–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2392/23920517.htm; http:/


series/0558/papers/2392/23920517.

pdf.

Anonymous:2002:AIaaaab




Carpineto:2002:CSM

[805] Claudio Carpineto. Conceptual struc-tures in modern information retrieval.Lecture Notes in Computer Science,2393:1–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2393/23930001.htm; http:


series/0558/papers/2393/23930001.

pdf.

Stumme:2002:FCA

[806] Gerd Stumme. Formal concept anal-ysis on its way from mathemat-ics to computer science. LectureNotes in Computer Science, 2393:2–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 168



bibs/2393/23930002.htm; http:/


series/0558/papers/2393/23930002.

pdf.

Sarbo:2002:LCM

[807] Janos Sarbo and Jozsef Farkas. Alinearly complex model for knowl-edge representation. Lecture Notesin Computer Science, 2393:20–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930020.htm; http:/


series/0558/papers/2393/23930020.

pdf.

Pollandt:2002:RGS

[808] Silke Pollandt. Relation graphs: Astructure for representing relations incontextual logic of relations. LectureNotes in Computer Science, 2393:34–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930034.htm; http:/


series/0558/papers/2393/23930034.

pdf.

Malik:2002:ITA

[809] Grit Malik. Information transferacross simple concept graphs. LectureNotes in Computer Science, 2393:48–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930048.htm; http:/


series/0558/papers/2393/23930048.

pdf.

Hereth:2002:RSD

[810] Joachim Hereth. Relational scal-ing and databases. Lecture Notesin Computer Science, 2393:62–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930062.htm; http:/


series/0558/papers/2393/23930062.

pdf.

Martin:2002:KRC

[811] Philippe Martin. Knowledge represen-tation in CGLF, CGIF, KIF, frame-CG and formalized-english. LectureNotes in Computer Science, 2393:77–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930077.htm; http:/


series/0558/papers/2393/23930077.

pdf.

Zhong:2002:CGM

[812] Jiwei Zhong, Haiping Zhu, JianmingLi, and Yong Yu. Conceptual graphmatching for semantic search. LectureNotes in Computer Science, 2393:92–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930092.htm; http:/


REFERENCES 169

series/0558/papers/2393/23930092.

pdf.

Gatzemeier:2002:TSM

[813] Felix H. Gatzemeier and Oliver Meyer.Text schema mining using graphsand formal concept analysis. LectureNotes in Computer Science, 2393:107–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930107.htm; http:/


series/0558/papers/2393/23930107.

pdf.

Montes-y-Gomez:2002:TMD

[814] Manuel Montes y Gomez, Alexan-der Gelbukh, and Aurelio Lopez-Lopez. Text mining at detail levelusing conceptual graphs. LectureNotes in Computer Science, 2393:122–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930122.htm; http:/


series/0558/papers/2393/23930122.

pdf.

Boytcheva:2002:PNN

[815] Svetla Boytcheva, Albena Strupchan-ska, and Galia Angelova. Pro-cessing negation in NL interfacesto knowledge bases. Lecture Notesin Computer Science, 2393:137–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930137.htm; http:/


series/0558/papers/2393/23930137.

pdf.

Reidsma:2002:AGE

[816] Dennis Reidsma. Automatic gen-eration and evaluation of sentencegraphs out of word graphs. LectureNotes in Computer Science, 2393:151–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930151.htm; http:/


series/0558/papers/2393/23930151.

pdf.

Scharfe:2002:CRN

[817] Henrik Scharfe. CG representationsof non-literal expressions. LectureNotes in Computer Science, 2393:166–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930166.htm; http:/


series/0558/papers/2393/23930166.

pdf.

Farkas:2002:POS

[818] Jozsef Farkas and Janos Sarbo. Apeircean ontology of semantics. Lec-ture Notes in Computer Science, 2393:177–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930177.htm; http:/


series/0558/papers/2393/23930177.

pdf.

REFERENCES 170

Delteil:2002:BCL

[819] Alexandre Delteil, Catherine Faron,and Rose Dieng. Building concept lat-tices by learning concepts from RDFgraphs annotating Web documents.Lecture Notes in Computer Science,2393:191–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2393/23930191.htm; http:


series/0558/papers/2393/23930191.

pdf.

Gerbe:2002:CFO

[820] Olivier Gerbe and Guy W. Mineau.The CG formalism as an ontolin-gua for Web-oriented representa-tion languages. Lecture Notesin Computer Science, 2393:205–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930205.htm; http:/


series/0558/papers/2393/23930205.

pdf.

Ribiere:2002:VMC

[821] Myriam Ribiere and Rose Dieng-Kuntz. A viewpoint model for coop-erative building of an ontology. Lec-ture Notes in Computer Science, 2393:220–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930220.htm; http:/


series/0558/papers/2393/23930220.

pdf.

Moor:2002:TPW

[822] Aldo de Moor, Mary Keeler, and GaryRichmond. Towards a pragmatic Web.Lecture Notes in Computer Science,2393:235–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2393/23930235.htm; http:


series/0558/papers/2393/23930235.

pdf.

Mineau:2002:FST

[823] Guy W. Mineau. A first step to-ward the Knowledge Web: Interoper-ability issues among conceptual graphbased software agents Part I. LectureNotes in Computer Science, 2393:250–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930250.htm; http:/


series/0558/papers/2393/23930250.

pdf.

Dobrev:2002:CAF

[824] Pavlin Dobrev and Kristina Toutanova.CGWorld — architecture and features.Lecture Notes in Computer Science,2393:261–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2393/23930261.htm; http:


series/0558/papers/2393/23930261.

pdf.

REFERENCES 171

Pimentel:2002:ESP

[825] Cesar F. Pimentel and Maria R.Cravo. Extending SNePSwD withpermissive belief revision. LectureNotes in Computer Science, 2393:271–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930271.htm; http:/


series/0558/papers/2393/23930271.

pdf.

Scharfe:2002:TCG

[826] Henrik Scharfe, Ulrik Petersen, andPeter hrstrøm. On teaching con-ceptual graphs. Lecture Notesin Computer Science, 2393:285–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930285.htm; http:/


series/0558/papers/2393/23930285.

pdf.

Ferre:2002:UAC

[827] Sebastien Ferre and Olivier Ri-doux. The use of associative con-cepts in the incremental building ofa logical context. Lecture Notesin Computer Science, 2393:299–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930299.htm; http:/


series/0558/papers/2393/23930299.

pdf.

Obiedkov:2002:MLE

[828] Sergei Obiedkov. Modal logicfor evaluating formulas in incom-plete contexts. Lecture Notesin Computer Science, 2393:314–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930314.htm; http:/


series/0558/papers/2393/23930314.

pdf.

Dau:2002:EEG

[829] Frithjof Dau. An embedding of ex-istential graphs into concept graphswith negations. Lecture Notesin Computer Science, 2393:326–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930326.htm; http:/


series/0558/papers/2393/23930326.

pdf.

Wolff:2002:IAT

[830] Karl Erich Wolff. Interpretation of au-tomata in temporal concept analysis.Lecture Notes in Computer Science,2393:341–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2393/23930341.htm; http:


series/0558/papers/2393/23930341.

pdf.

REFERENCES 172

Priss:2002:AFC

[831] Uta Priss. Associative and formalconcepts. Lecture Notes in ComputerScience, 2393:354–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2393/23930354.



2393/23930354.pdf.

Klinger:2002:SGV

[832] Julia Klinger. Semiconcept graphswith variables. Lecture Notesin Computer Science, 2393:369–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930369.htm; http:/


series/0558/papers/2393/23930369.

pdf.

Wille:2002:ECG

[833] Rudolf Wille. Existential conceptgraphs of power context families. Lec-ture Notes in Computer Science, 2393:382–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2393/23930382.htm; http:/


series/0558/papers/2393/23930382.

pdf.

Anonymous:2002:AIaaaac

[834] Anonymous. Author index. LectureNotes in Computer Science, 2393:397–??, 2002. CODEN LNCSD9. ISSN




Blanc:2002:SRW

[835] Erika Blanc and Paolo Giudici. Se-quence rules for Web clickstream analy-sis. Lecture Notes in Computer Science,2394:1–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2394/23940001.htm; http:


series/0558/papers/2394/23940001.

pdf.

Hipp:2002:DMA

[836] Jochen Hipp, Ulrich Guntzer, and Gho-lamreza Nakhaeizadeh. Data miningof association rules and the process ofknowledge discovery in databases. Lec-ture Notes in Computer Science, 2394:15–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2394/23940015.htm; http:/


series/0558/papers/2394/23940015.

pdf.

Perner:2002:IMW

[837] P. Perner and G. Fiss. In-telligent E-marketing with Webmining, personalization, and user-adpated interfaces. Lecture Notesin Computer Science, 2394:37–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 173

bibs/2394/23940037.htm; http:/


series/0558/papers/2394/23940037.

pdf.

Althoff:2002:IPE

[838] Klaus-Dieter Althoff, Ulrike Becker-Kornstaedt, Bjorn Decker, AndreasKlotz, Edda Leopold, Jorg Rech, andAngi Voss. The indiGo project:Enhancement of experience manage-ment and process learning with mod-erated discourses. Lecture Notesin Computer Science, 2394:53–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2394/23940053.htm; http:/


series/0558/papers/2394/23940053.

pdf.

Glass:2002:GDE

[839] Anne Glass and Thomas Karopka.Genomic data explosion — the chal-lenge for bioinformatics? LectureNotes in Computer Science, 2394:80–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2394/23940080.htm; http:/


series/0558/papers/2394/23940080.

pdf.

Schmidt:2002:CBR

[840] Rainer Schmidt and Lothar Gierl.Case-based reasoning for prognosis ofthreatening influenza waves. LectureNotes in Computer Science, 2394:99–??, 2002. CODEN LNCSD9. ISSN



bibs/2394/23940099.htm; http:/


series/0558/papers/2394/23940099.

pdf.

Anonymous:2002:AIaaaad




Macrini:2002:SMV

[842] Diego Macrini, Ali Shokoufandeh,Sven Dickinson, Kaleem Siddiqi, andSteven Zucker. Spectral methodsfor view-based 3-D object recog-nition using silhouettes. LectureNotes in Computer Science, 2396:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960001.htm; http:/


series/0558/papers/2396/23960001.

pdf.

Dietterich:2002:MLS

[843] Thomas G. Dietterich. Machine learn-ing for sequential data: A review. Lec-ture Notes in Computer Science, 2396:15–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960015.htm; http:/


REFERENCES 174

series/0558/papers/2396/23960015.

pdf.

Hancock:2002:GBM

[844] Edwin Hancock and Richard C. Wil-son. Graph-based methods for vi-sion: A yorkist manifesto. LectureNotes in Computer Science, 2396:31–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960031.htm; http:/


series/0558/papers/2396/23960031.

pdf.

Martinez-Hinarejos:2002:RCC

[845] Carlos D. Martınez-Hinarejos, Al-fonso Juan, Francisco Casacuberta,and Ramon Mollineda. Reducing thecomputational cost of computing ap-proximated median strings. LectureNotes in Computer Science, 2396:47–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960047.htm; http:/


series/0558/papers/2396/23960047.

pdf.

Verdu-Mas:2002:TKG

[846] Jose L. Verdu-Mas, Mikel L. For-cada, Rafael C. Carrasco, and JorgeCalera-Rubio. Tree k-grammarmodels for natural language mod-elling and parsing. Lecture Notesin Computer Science, 2396:56–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960056.htm; http:/


series/0558/papers/2396/23960056.

pdf.

Fernau:2002:ALF

[847] Henning Fernau and Agnes Radl. Al-gorithms for learning function distin-guishable regular languages. LectureNotes in Computer Science, 2396:64–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960064.htm; http:/


series/0558/papers/2396/23960064.

pdf.

Wyk:2002:NBG

[848] B. J. van Wyk and M. A. van Wyk.Non-bayesian graph matching withoutexplicit compatibility calculations. Lec-ture Notes in Computer Science, 2396:74–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960074.htm; http:/


series/0558/papers/2396/23960074.

pdf.

Luo:2002:SFV

[849] Bin Luo, Richard C. Wilson, and Ed-win R. Hancock. Spectral featurevectors for graph clustering. LectureNotes in Computer Science, 2396:83–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 175

bibs/2396/23960083.htm; http:/


series/0558/papers/2396/23960083.

pdf.

Fischer:2002:IDG

[850] Stefan Fischer, Kaspar Gilomen, andHorst Bunke. Identification of di-atoms by grid graph matching. Lec-ture Notes in Computer Science, 2396:94–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960094.htm; http:/


series/0558/papers/2396/23960094.

pdf.

Robles-Kelly:2002:SED

[851] Antonio Robles-Kelly and Edwin R.Hancock. String edit distance, ran-dom walks and graph matching. Lec-ture Notes in Computer Science, 2396:104–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960104.htm; http:/


series/0558/papers/2396/23960104.

pdf.

Torsello:2002:LSV

[852] Andrea Torsello and Edwin R. Han-cock. Learning structural varia-tions in shock trees. Lecture Notesin Computer Science, 2396:113–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960113.htm; http:/


series/0558/papers/2396/23960113.

pdf.

Bunke:2002:CAM

[853] H. Bunke, P. Foggia, C. Guidobaldi,C. Sansone, and M. Vento. Acomparison of algorithms for maxi-mum common subgraph on randomlyconnected graphs. Lecture Notesin Computer Science, 2396:123–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960123.htm; http:/


series/0558/papers/2396/23960123.

pdf.

Kosinov:2002:IMM

[854] Serhiy Kosinov and Terry Caelli. In-exact multisubgraph matching us-ing graph eigenspace and clus-tering models. Lecture Notesin Computer Science, 2396:133–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960133.htm; http:/


series/0558/papers/2396/23960133.

pdf.

Jiang:2002:OLB

[855] Xiaoyi Jiang and Horst Bunke. Op-timal lower bound for generalized me-dian problems in metric space. Lec-ture Notes in Computer Science, 2396:143–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 176


bibs/2396/23960143.htm; http:/


series/0558/papers/2396/23960143.

pdf.

Amin:2002:SDR

[856] Adnan Amin. Structural descriptionto recognising Arabic characters usingdecision tree learning techniques. Lec-ture Notes in Computer Science, 2396:152–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960152.htm; http:/


series/0558/papers/2396/23960152.

pdf.

Duong:2002:FAP

[857] Jean Duong, Myrian Cote, and Hu-bert Emptoz. Feature approach forprinted document image analysis. Lec-ture Notes in Computer Science, 2396:159–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960159.htm; http:/


series/0558/papers/2396/23960159.

pdf.

Wenyin:2002:EDG

[858] Liu Wenyin. Example-driven graph-ics recognition. Lecture Notesin Computer Science, 2396:168–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960168.htm; http:/


series/0558/papers/2396/23960168.

pdf.

Gimelfarb:2002:ETR

[859] Georgy Gimel’farb. Estimation of tex-els for regular mosaics using model-based interaction maps. Lecture Notesin Computer Science, 2396:177–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960177.htm; http:/


series/0558/papers/2396/23960177.

pdf.

Gregory:2002:UGS

[860] Lee Gregory and Josef Kittler. Us-ing graph search techniques for con-textual colour retrieval. Lecture Notesin Computer Science, 2396:186–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960186.htm; http:/


series/0558/papers/2396/23960186.

pdf.

Tassone:2002:CST

[861] Ezra Tassone, Geoff West, and SvethaVenkatesh. Comparing shape andtemporal PDMs. Lecture Notesin Computer Science, 2396:195–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960195.htm; http:/


REFERENCES 177

series/0558/papers/2396/23960195.

pdf.

Al-Shaher:2002:LSR

[862] Abdullah A. Al-Shaher and Edwin R.Hancock. Linear shape recogni-tion with mixtures of point dis-tribution models. Lecture Notesin Computer Science, 2396:205–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960205.htm; http:/


series/0558/papers/2396/23960205.

pdf.

Sartori:2002:CWE

[863] Fabio Sartori and Edwin R. Hancock.Curvature weighted evidence combina-tion for shape-from-shading. LectureNotes in Computer Science, 2396:216–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960216.htm; http:/


series/0558/papers/2396/23960216.

pdf.

Michaelsen:2002:PDP

[864] E. Michaelsen and U. Stilla. Probabilis-tic decisions in production nets: Anexample from vehicle recognition. Lec-ture Notes in Computer Science, 2396:225–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960225.htm; http:/


series/0558/papers/2396/23960225.

pdf.

Langs:2002:HTE

[865] Georg Langs, Horst Bischof, and Wal-ter G. Kropatsch. Hierarchical topdown enhancement of robust PCA.Lecture Notes in Computer Science,2396:234–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2396/23960234.htm; http:


series/0558/papers/2396/23960234.

pdf.

Lazarescu:2002:AML

[866] Mihai Lazarescu, Andrew Turpin,and Svetha Venkatesh. An ap-plication of machine learning tech-niques for the classification of glau-comatous progression. Lecture Notesin Computer Science, 2396:243–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960243.htm; http:/


series/0558/papers/2396/23960243.

pdf.

Serratosa:2002:EJP

[867] Francesc Serratosa, Rene Alquezar,and Alberto Sanfeliu. Estimating thejoint probability distribution of ran-dom vertices and arcs by means ofsecond-order random graphs. LectureNotes in Computer Science, 2396:252–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 178


bibs/2396/23960252.htm; http:/


series/0558/papers/2396/23960252.

pdf.

Wyk:2002:SPG

[868] B. J. van Wyk, M. A. van Wyk,and H. E. Hanrahan. Successiveprojection graph matching. LectureNotes in Computer Science, 2396:263–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960263.htm; http:/


series/0558/papers/2396/23960263.

pdf.

Popel:2002:CGM

[869] Denis V. Popel. Compact graph modelof handwritten images: Integrationinto authentification and recognition.Lecture Notes in Computer Science,2396:272–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2396/23960272.htm; http:


series/0558/papers/2396/23960272.

pdf.

Delalandre:2002:SSA

[870] Mathieu Delalandre, Pierre Heroux,Sebastien Adam, Eric Trupin, andJean-Marc Ogier. A statistical andstructural approach for symbol recog-nition, using XML modelling. LectureNotes in Computer Science, 2396:281–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2396/23960281.htm; http:/


series/0558/papers/2396/23960281.

pdf.

Hlaoui:2002:NAG

[871] Adel Hlaoui and Shengrui Wang.A new algorithm for graph match-ing with application to content-based image retrieval. Lecture Notesin Computer Science, 2396:291–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960291.htm; http:/


series/0558/papers/2396/23960291.

pdf.

Azuela:2002:ECD

[872] Juan Humberto Sossa Azuela, Fran-cisco Cuevas de la Rosa, and HectorBenitez. Efficient computation of3-D moments in terms of an ob-ject’s partition. Lecture Notesin Computer Science, 2396:301–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960301.htm; http:/


series/0558/papers/2396/23960301.

pdf.

Palenichka:2002:VAO

[873] Roman M. Palenichka. A visual at-tention operator based on morpho-logical models of images and max-imum likelihood decision. Lecture

REFERENCES 179



bibs/2396/23960310.htm; http:/


series/0558/papers/2396/23960310.

pdf.

Ulusoy:2002:DUF

[874] Ilkay Ulusoy, Edwin R. Hancock, andUgur Halici. Disparity using fea-ture points in multi scale. LectureNotes in Computer Science, 2396:320–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960320.htm; http:/


series/0558/papers/2396/23960320.

pdf.

Cheoi:2002:DPI

[875] Kyungjoo Cheoi and Yillbyung Lee.Detecting perceptually important re-gions in an image based on human vi-sual attention characteristic. LectureNotes in Computer Science, 2396:329–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960329.htm; http:/


series/0558/papers/2396/23960329.

pdf.

Alam:2002:DSL

[876] Hassan Alam, Ahmad Fuad RezaurRahman, Timotius Tjahjadi, HuaCheng, Paul Llid Aman Kumar, Rach-

mat Hartono, Yulia Tarnikova, andChe Wilcox. Development of spo-ken language user interfaces: Atool kit approach. Lecture Notesin Computer Science, 2396:339–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960339.htm; http:/


series/0558/papers/2396/23960339.

pdf.

Wu:2002:DIW

[877] Changhua Wu and Gady Agam. Doc-ument image de-warping for text/graphics recognition. Lecture Notesin Computer Science, 2396:348–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960348.htm; http:/


series/0558/papers/2396/23960348.

pdf.

Lehal:2002:COS

[878] G. S. Lehal and Chandan Singh. Acomplete OCR system for Gurmukhiscript. Lecture Notes in ComputerScience, 2396:358–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2396/23960358.



2396/23960358.pdf.

Grau:2002:TNA

[879] Antoni Grau, Joan Climent, Francesc

REFERENCES 180

Serratosa, and Alberto Sanfeliu. Tex-print : A new algorithm to discrim-inate textures structurally. LectureNotes in Computer Science, 2396:368–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960368.htm; http:/


series/0558/papers/2396/23960368.

pdf.

Droettboom:2002:OMI

[880] Michael Droettboom, Ichiro Fujinaga,and Karl MacMillan. Optical mu-sic interpretation. Lecture Notesin Computer Science, 2396:378–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960378.htm; http:/


series/0558/papers/2396/23960378.

pdf.

Azuela:2002:SCC

[881] Juan Humberto Sossa Azuela, Au-relio Velazquez, and Serguei Lev-achkine. On the segmentation ofcolor cartographic images. LectureNotes in Computer Science, 2396:387–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960387.htm; http:/


series/0558/papers/2396/23960387.

pdf.

Aladjem:2002:PPF

[882] Mayer Aladjem. Projection pursuit fit-ting Gaussian mixture models. LectureNotes in Computer Science, 2396:396–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960396.htm; http:/


series/0558/papers/2396/23960396.

pdf.

Kato:2002:AGA

[883] Tsuyoshi Kato, Shinichiro Omachi,and Hirotomo Aso. AsymmetricGaussian and its application to pat-tern recognition. Lecture Notesin Computer Science, 2396:405–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960405.htm; http:/


series/0558/papers/2396/23960405.

pdf.

Sadeghi:2002:MPV

[884] Mohammad Sadeghi and Josef Kittler.Modified predictive validation test forGaussian mixture modelling. LectureNotes in Computer Science, 2396:414–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960414.htm; http:/


series/0558/papers/2396/23960414.

pdf.

REFERENCES 181

Fumera:2002:PAC

[885] Giorgio Fumera and Fabio Roli. Perfor-mance analysis and comparison of lin-ear combiners for classifier fusion. Lec-ture Notes in Computer Science, 2396:424–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960424.htm; http:/


series/0558/papers/2396/23960424.

pdf.

Somorjai:2002:CTC

[886] Ray Somorjai, Arunas Janeliunas,Richard Baumgartner, and SarunasRaudys. Comparison of two clas-sification methodologies on a real-world biomedical problem. LectureNotes in Computer Science, 2396:433–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960433.htm; http:/


series/0558/papers/2396/23960433.

pdf.

Fred:2002:EAC

[887] Ana Fred and Anil K. Jain. Evi-dence accumulation clustering basedon the K-means algorithm. LectureNotes in Computer Science, 2396:442–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960442.htm; http:/


series/0558/papers/2396/23960442.

pdf.

Webb:2002:KAM

[888] Andrew Webb. A kernel approach tometric multidimensional scaling. Lec-ture Notes in Computer Science, 2396:452–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960452.htm; http:/


series/0558/papers/2396/23960452.

pdf.

Paclik:2002:FSM

[889] Pavel Paclık, Robert P. W. Duin,Geert M. P. van Kempen, and Rein-hard Kohlus. On feature selec-tion with measurement cost andgrouped features. Lecture Notesin Computer Science, 2396:461–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960461.htm; http:/


series/0558/papers/2396/23960461.

pdf.

Abe:2002:CIF

[890] Naoto Abe, Mineichi Kudo, andMasaru Shimbo. Classifier-independentfeature selection based on non-parametric discriminant analysis. Lec-ture Notes in Computer Science, 2396:470–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960470.htm; http:/


series/0558/papers/2396/23960470.

pdf.

REFERENCES 182

Schulerud:2002:EMF

[891] Helene Schulerud and Fritz Albregtsen.Effects of many feature candidates infeature selection and classification. Lec-ture Notes in Computer Science, 2396:480–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960480.htm; http:/


series/0558/papers/2396/23960480.

pdf.

Pekalska:2002:SRD

[892] Elzbieta Pekalska and Robert P. W.Duin. Spatial representation of dissim-ilarity data via lower-complexity lin-ear and nonlinear mappings. LectureNotes in Computer Science, 2396:488–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960488.htm; http:/


series/0558/papers/2396/23960488.

pdf.

Iwamura:2002:MET

[893] Masakazu Iwamura, Shinichiro Omachi,and Hirotomo Aso. A method toestimate the true Mahalanobis dis-tance from eigenvectors of samplecovariance matrix. Lecture Notesin Computer Science, 2396:498–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960498.htm; http:/


series/0558/papers/2396/23960498.

pdf.

Loog:2002:NIH

[894] M. Loog and R. P. W. Duin. Non-iterative heteroscedastic linear dimen-sion reduction for two-class data. Lec-ture Notes in Computer Science, 2396:508–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960508.htm; http:/


series/0558/papers/2396/23960508.

pdf.

Barandela:2002:SES

[895] R. Barandela, F. J. Ferri, andT. Najera. Some experiments in su-pervised pattern recognition with in-complete training samples. LectureNotes in Computer Science, 2396:518–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960518.htm; http:/


series/0558/papers/2396/23960518.

pdf.

Kim:2002:RPR

[896] Sang-Woon Kim and B. J. Oommen.Recursive prototype reduction schemesapplicable for large data sets. LectureNotes in Computer Science, 2396:528–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960528.htm; http:/


REFERENCES 183

series/0558/papers/2396/23960528.

pdf.

Keysers:2002:CTV

[897] Daniel Keysers, Roberto Paredes, Her-mann Ney, and Enrique Vidal. Com-bination of tangent vectors and lo-cal representations for handwrittendigit recognition. Lecture Notesin Computer Science, 2396:538–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960538.htm; http:/


series/0558/papers/2396/23960538.

pdf.

Cano:2002:TSE

[898] Javier Cano, Juan-Carlos Perez-Cortes, Joaquim Arlandis, and RafaelLlobet. Training set expansion in hand-written character recognition. LectureNotes in Computer Science, 2396:548–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960548.htm; http:/


series/0558/papers/2396/23960548.

pdf.

Bakus:2002:DCU

[899] Jan Bakus and Mohamed Kamel. Doc-ument classification using phrases. Lec-ture Notes in Computer Science, 2396:557–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960557.htm; http:/


series/0558/papers/2396/23960557.

pdf.

Hamouz:2002:FDL

[900] Miroslav Hamouz, Josef Kittler, JiriMatas, and Petr Bılek. Face detectionby learned affine correspondences. Lec-ture Notes in Computer Science, 2396:566–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960566.htm; http:/


series/0558/papers/2396/23960566.

pdf.

Ragheb:2002:SSH

[901] Hossein Ragheb and Edwin R. Han-cock. Shape-from-shading for high-lighted surfaces. Lecture Notesin Computer Science, 2396:576–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960576.htm; http:/


series/0558/papers/2396/23960576.

pdf.

Ridder:2002:TDI

[902] Dick de Ridder, Robert P. W. Duin,and Josef Kittler. Texture descriptionby independent components. LectureNotes in Computer Science, 2396:587–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960587.htm; http:/


REFERENCES 184

series/0558/papers/2396/23960587.

pdf.

Kittler:2002:FMC

[903] Josef Kittler, Marco Ballette, W. J.Christmas, Edward Jaser, and KieronMesser. Fusion of multiple cue de-tectors for automatic sports video an-notation. Lecture Notes in ComputerScience, 2396:597–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2396/23960597.



2396/23960597.pdf.

Giacinto:2002:QSB

[904] Giorgio Giacinto and Fabio Roli.Query shifting based on Bayesiandecision theory for content-basedimage retrieval. Lecture Notesin Computer Science, 2396:607–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960607.htm; http:/


series/0558/papers/2396/23960607.

pdf.

Haindl:2002:RMB

[905] Michal Haindl. Recursive model-basedcolour image restoration. LectureNotes in Computer Science, 2396:617–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960617.htm; http:/


series/0558/papers/2396/23960617.

pdf.

Haddadnia:2002:HFR

[906] Javad Haddadnia, Majid Ahmadi, andKarim Faez. Human face recognitionwith different statistical features. Lec-ture Notes in Computer Science, 2396:627–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960627.htm; http:/


series/0558/papers/2396/23960627.

pdf.

Huang:2002:TBM

[907] Yea-Shuan Huang and Yao-Hong Tsai.A transformation-based mechanismfor face recognition. Lecture Notesin Computer Science, 2396:636–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960636.htm; http:/


series/0558/papers/2396/23960636.

pdf.

Garcia-Mateos:2002:FDU

[908] Gines Garcıa-Mateos, Alberto Ruiz,and Pedro E. Lopez de Teruel.Face detection using integral pro-jection models. Lecture Notesin Computer Science, 2396:644–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960644.htm; http:/


REFERENCES 185

series/0558/papers/2396/23960644.

pdf.

Ko:2002:INF

[909] Jaepil Ko, Eunju Kim, and HeyranByun. Illumination normalized faceimage for face recognition. LectureNotes in Computer Science, 2396:654–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960654.htm; http:/


series/0558/papers/2396/23960654.

pdf.

Solar:2002:TGE

[910] Javier Ruiz del Solar and Pablo Navar-rete. Towards a generalized eigenspace-based face recognition framework. Lec-ture Notes in Computer Science, 2396:662–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960662.htm; http:/


series/0558/papers/2396/23960662.

pdf.

Gomez:2002:ASS

[911] Jon Ander Gomez and Marıa JoseCastro. Automatic segmentation ofspeech at the phonetic level. LectureNotes in Computer Science, 2396:672–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960672.htm; http:/


series/0558/papers/2396/23960672.

pdf.

Kinnunen:2002:CDW

[912] Tomi Kinnunen and Ismo Karkkainen.Class-discriminative weighted distor-tion measure for VQ-based speakeridentification. Lecture Notes in Com-puter Science, 2396:681–??, 2002. CO-DEN LNCSD9. ISSN 0302-9743(print), 1611-3349 (electronic). URLhttp://link.springer-ny.com/link/




2396/23960681.pdf.

Semani:2002:AFS

[913] Dahbia Semani, Christophe Saint-Jean, Carl Frelicot, Thierry Bouw-mans, and Pierre Courtellemont. Alivefishes species characterization fromvideo sequences. Lecture Notesin Computer Science, 2396:689–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960689.htm; http:/


series/0558/papers/2396/23960689.

pdf.

Santo:2002:ACD

[914] Massimo De Santo, Gennaro Percan-nella, Carlo Sansone, Roberto San-toro, and Mario Vento. Automaticcut detection in MPEG movies: Amulti-expert approach. Lecture Notesin Computer Science, 2396:699–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 186


bibs/2396/23960699.htm; http:/


series/0558/papers/2396/23960699.

pdf.

Copsey:2002:BNI

[915] Keith Copsey and Andrew Webb.Bayesian networks for incorporationof contextual information in targetrecognition systems. Lecture Notesin Computer Science, 2396:709–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960709.htm; http:/


series/0558/papers/2396/23960709.

pdf.

Moreno-Seco:2002:ELF

[916] Francisco Moreno-Seco, Luisa Mico,and Jose Oncina. Extending LAESAfast nearest neighbour algorithm tofind the k nearest neighbours. LectureNotes in Computer Science, 2396:718–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960718.htm; http:/


series/0558/papers/2396/23960718.

pdf.

Gomez-Ballester:2002:FAM

[917] Eva Gomez-Ballester, Luisa Mico,and Jose Oncina. A fast approxi-mated k-median algorithm. LectureNotes in Computer Science, 2396:725–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2396/23960725.htm; http:/


series/0558/papers/2396/23960725.

pdf.

Panuccio:2002:HMM

[918] Antonello Panuccio, Manuele Bicego,and Vittorio Murino. A hiddenMarkov model-based approach to se-quential data clustering. LectureNotes in Computer Science, 2396:734–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960734.htm; http:/


series/0558/papers/2396/23960734.

pdf.

Perez-Jimenez:2002:GAE

[919] Alberto Perez-Jimenez and Juan-Carlos Perez-Cortes. Genetic algo-rithms for exploratory data analysis.Lecture Notes in Computer Science,2396:743–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2396/23960743.htm; http:


series/0558/papers/2396/23960743.

pdf.

Nyssen:2002:PML

[920] Edgard Nyssen, Naren Naik, and BartTruyen. Piecewise multi-linear PDFmodelling, using an ML approach. Lec-ture Notes in Computer Science, 2396:752–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 187



bibs/2396/23960752.htm; http:/


series/0558/papers/2396/23960752.

pdf.

Aoki:2002:DTU

[921] Kazuaki Aoki and Mineichi Kudo.Decision tree using class-dependentfeature subsets. Lecture Notesin Computer Science, 2396:761–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960761.htm; http:/


series/0558/papers/2396/23960761.

pdf.

Sirlantzis:2002:FTB

[922] Konstantinos Sirlantzis, Sanaul Hoque,Michael C. Fairhurst, and Ah-mad Fuad Rezaur Rahman. Fu-sion of n-tuple based classifiers forhigh performance handwritten char-acter recognition. Lecture Notesin Computer Science, 2396:770–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960770.htm; http:/


series/0558/papers/2396/23960770.

pdf.

Draper:2002:BPA

[923] Bruce A. Draper, Kyungim Baek, andJeff Boody. A biologically plausible ap-proach to cat and dog discrimination.Lecture Notes in Computer Science,



0558/bibs/2396/23960779.htm; http:


series/0558/papers/2396/23960779.

pdf.

Windridge:2002:MUC

[924] David Windridge and Josef Kit-tler. Morphologically unbiased clas-sifier combination through graphi-cal PDF correlation. Lecture Notesin Computer Science, 2396:789–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960789.htm; http:/


series/0558/papers/2396/23960789.

pdf.

Sakano:2002:CUC

[925] Hitoshi Sakano and Takashi Sue-naga. Classifiers under continu-ous observations. Lecture Notesin Computer Science, 2396:798–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960798.htm; http:/


series/0558/papers/2396/23960798.

pdf.

Wang:2002:TCB

[926] Jing-Wein Wang. Texture classifica-tion based on coevolution approach inmultiwavelet feature space. LectureNotes in Computer Science, 2396:806–

REFERENCES 188



bibs/2396/23960806.htm; http:/


series/0558/papers/2396/23960806.

pdf.

Gimelfarb:2002:PSM

[927] Georgy Gimel’farb and Uri Lipowezky.Probabilistic signal models to regu-larise dynamic programming stereo.Lecture Notes in Computer Science,2396:814–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2396/23960814.htm; http:


series/0558/papers/2396/23960814.

pdf.

Imiya:2002:HTA

[928] Atsushi Imiya, Tetsu Hada, and KenTatara. The Hough transform with-out the accumulators. Lecture Notesin Computer Science, 2396:823–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960823.htm; http:/


series/0558/papers/2396/23960823.

pdf.

Inesta:2002:RGL

[929] Jose Manuel Inesta and Jorge Calera-Rubio. Robust gray-level histogramGaussian characterisation. LectureNotes in Computer Science, 2396:833–??, 2002. CODEN LNCSD9. ISSN



bibs/2396/23960833.htm; http:/


series/0558/papers/2396/23960833.

pdf.

Haindl:2002:MBF

[930] Michal Haindl and Hynek Lauschmann.Model-based fatique fractographstexture analysis. Lecture Notesin Computer Science, 2396:842–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2396/23960842.htm; http:/


series/0558/papers/2396/23960842.

pdf.

Azimifar:2002:HMM

[931] Zohreh Azimifar, Paul Fieguth, andEd Jernigan. Hierarchical multiscalemodeling of wavelet-based correlations.Lecture Notes in Computer Science,2396:850–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2396/23960850.htm; http:


series/0558/papers/2396/23960850.

pdf.

Anonymous:2002:AIaaaae


REFERENCES 189



Kerscher:2002:SAD

[933] George Kerscher. Structured access todocuments, digital talking books, andbeyond: The DAISY consortium. Lec-ture Notes in Computer Science, 2398:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980001.htm; http:/


series/0558/papers/2398/23980001.

pdf.

Session:2002:EEU

[934] Introduction to the Special The-matic Session. eEurope — eAccessibil-ity — user participation participationof people with disabilities and olderpeople in the information society. Lec-ture Notes in Computer Science, 2398:3–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980003.htm; http:/


series/0558/papers/2398/23980003.

pdf.

Workshop:2002:RBI

[935] Introduction to the Workshop. Fromresearch to business improving the takeup of results of research projects. Lec-ture Notes in Computer Science, 2398:6–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980006.htm; http:/


series/0558/papers/2398/23980006.

pdf.

Session:2002:UAI

[936] Introduction to the Special The-matic Session. Universal access to in-formation society technologies: Op-portunities for people with disabilities.Lecture Notes in Computer Science,2398:8–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980008.htm; http:


series/0558/papers/2398/23980008.

pdf.

Gladstone:2002:AUE

[937] Keith Gladstone, Cathy Rundle, andTara Alexander. Accessibility and us-ability of eCommerce systems. LectureNotes in Computer Science, 2398:11–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980011.htm; http:/


series/0558/papers/2398/23980011.

pdf.

Pieper:2002:RCS

[938] M. Pieper. Recommending context-sensitive and process-oriented touristinformation to the disabled —the PALIO case. Lecture Notesin Computer Science, 2398:19–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 190

bibs/2398/23980019.htm; http:/


series/0558/papers/2398/23980019.

pdf.

Chene:2002:WSA

[939] Denis Chene and Michel Hoel. Website accessibility auditing tool for visu-ally deficient persons OCAWA. LectureNotes in Computer Science, 2398:27–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980027.htm; http:/


series/0558/papers/2398/23980027.

pdf.

Holzinger:2002:UCI

[940] Andreas Holzinger. User-centered in-terface design for disabled and el-derly people: First experiences withdesigning a patient communicationsystem (PACOSY). Lecture Notesin Computer Science, 2398:33–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980033.htm; http:/


series/0558/papers/2398/23980033.

pdf.

Stephanidis:2002:DCE

[941] Constantine Stephanidis. The dis-appearing computer: Emerging op-portunities and challenges for dis-abled and elderly people. LectureNotes in Computer Science, 2398:41–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2398/23980041.htm; http:/


series/0558/papers/2398/23980041.

pdf.

Emiliani:2002:NTS

[942] Pier Luigi Emiliani. New technolo-gies and services for disabled andelderly people in the emerging in-formation society. Lecture Notesin Computer Science, 2398:49–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980049.htm; http:/


series/0558/papers/2398/23980049.

pdf.

Duchateau:2002:SAA

[943] Sylvie Duchateau, Denis Boulay, Clau-dine Tchang-Ayo, and DominiqueBurger. A strategy to achieve the ac-cessibility of public Web sites. LectureNotes in Computer Science, 2398:58–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980058.htm; http:/


series/0558/papers/2398/23980058.

pdf.

Privat:2002:AAV

[944] Regis Privat, Nadine Vigouroux,Philippe Truillet, and Bernard Ori-ola. Accessibility and affordancefor voice interactive systems withthe VoiceXML technology. Lecture

REFERENCES 191



bibs/2398/23980061.htm; http:/


series/0558/papers/2398/23980061.

pdf.

Session:2002:CIE

[945] Introduction to the Special The-matic Session. Computer and in-clusive education. Lecture Notesin Computer Science, 2398:64–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980064.htm; http:/


series/0558/papers/2398/23980064.

pdf.

Watkins:2002:NIC

[946] Amanda Watkins and Harald Weber.National information and communi-cation technology policies. LectureNotes in Computer Science, 2398:68–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980068.htm; http:/


series/0558/papers/2398/23980068.

pdf.

Rainwald:2002:EVS

[947] Walter Rainwald. EUN virtual schoolspecial needs education. LectureNotes in Computer Science, 2398:76–??, 2002. CODEN LNCSD9. ISSN



bibs/2398/23980076.htm; http:/


series/0558/papers/2398/23980076.

pdf.

Pieper:2002:TST

[948] M. Pieper. Tutorial systems toteach standard applications to thelearning disabled. Lecture Notesin Computer Science, 2398:83–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980083.htm; http:/


series/0558/papers/2398/23980083.

pdf.

Archambault:2002:VP

[949] Dominique Archambault and Do-minique Burger. The Vickie Project.Lecture Notes in Computer Science,2398:90–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980090.htm; http:


series/0558/papers/2398/23980090.

pdf.

Kurhila:2002:UAH

[950] Jaakko Kurhila and Hanna Var-jola. Using adaptive hypermediato evaluate basic arithmetic skillsin special education. Lecture Notesin Computer Science, 2398:98–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 192



bibs/2398/23980098.htm; http:/


series/0558/papers/2398/23980098.

pdf.

Feyerer:2002:IAT

[951] Ewald Feyerer, Klaus Miesenberger,and David Wohlhart. ICT and as-sistive technology in teachers edu-cation and training. Lecture Notesin Computer Science, 2398:107–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980107.htm; http:/


series/0558/papers/2398/23980107.

pdf.

Greve:2002:BIG

[952] Jørgen Greve and Harald Weber.Bridging the information gap betweenIST and SEN — A practical ap-proach on European level. LectureNotes in Computer Science, 2398:115–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980115.htm; http:/


series/0558/papers/2398/23980115.

pdf.

Mohamad:2002:EST

[953] Yehya Mohamad, S. Hammer, F. Haverkamp,M. Noker, and H. Tebarth. Eval-uational study: Training with ani-mated pedagogical agents. LectureNotes in Computer Science, 2398:117–



bibs/2398/23980117.htm; http:/


series/0558/papers/2398/23980117.

pdf.

Prazak:2002:UMT

[954] Barbara Prazak and Mathilde Niehaus.Usage of modern technologies — Achance for people with special needs?!— pedagogically relevant criteria forthe review of educational software ex-emplified by “Step by Step 3”. Lec-ture Notes in Computer Science, 2398:125–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980125.htm; http:/


series/0558/papers/2398/23980125.

pdf.

Edler:2002:SII

[955] Cordula Edler. Social innovation in theinformation society — take it easy. Lec-ture Notes in Computer Science, 2398:128–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980128.htm; http:/


series/0558/papers/2398/23980128.

pdf.

Wohlhart:2002:OII

[956] David Wohlhart. ODL:Inclusive —improving inclusive teaching throughonline training. Lecture Notes

REFERENCES 193



bibs/2398/23980130.htm; http:/


series/0558/papers/2398/23980130.

pdf.

Coombs:2002:ALI

[957] Norman Coombs. Accessible E-learning: Infrastructure and content.Lecture Notes in Computer Science,2398:133–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980133.htm; http:


series/0558/papers/2398/23980133.

pdf.

Turrini:2002:AWY

[958] Giovanna Turrini, Laura Cignoni, andAlessandro Paccosi. Addizionario:Words in your pocket. Lecture Notesin Computer Science, 2398:136–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980136.htm; http:/


series/0558/papers/2398/23980136.

pdf.

Shopland:2002:VTT

[959] N. Shopland, J. Lewis, D. J. Brown,and H. M. Powell. Virtual travel train-ing for people with learning disabil-ities accessing employment includingthe introduction to the special the-

matic session “Virtual Reality”. Lec-ture Notes in Computer Science, 2398:140–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980140.htm; http:/


series/0558/papers/2398/23980140.

pdf.

Alcantud:2002:AVR

[960] F. Alcantud, G. Herrera, G. Labajo,I. Dolz, C. Gaya, V. Avila, A. Blan-quer, J. L. Cuesta, and J. Arnaiz.Assessing virtual reality as a tool forsupport imagination. Lecture Notesin Computer Science, 2398:143–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980143.htm; http:/


series/0558/papers/2398/23980143.

pdf.

Brown:2002:LNE

[961] D. J. Brown, M. Yazdanparast,J. Lewis, N. Shopland, and H. M.Powell. Literacy and numeracyedutainment packages for disaffectedyoung learners. Lecture Notesin Computer Science, 2398:145–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980145.htm; http:/


series/0558/papers/2398/23980145.

pdf.

REFERENCES 194

Standen:2002:CVE

[962] P. J. Standen, S. Battersby, andT. L. Lannen. Control of virtualenvironments for people with intel-lectual disabilities. Lecture Notesin Computer Science, 2398:147–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980147.htm; http:/


series/0558/papers/2398/23980147.

pdf.

Battersby:2002:OGP

[963] S. J. Battersby, N. Kelly, D. J. Brown,and H. M. Powell. Online gardeningto promote social inclusion. LectureNotes in Computer Science, 2398:150–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980150.htm; http:/


series/0558/papers/2398/23980150.

pdf.

Bauer:2002:SPS

[964] D. Bauer, A. Plinge, and M. Finke.Selective phoneme spotting for realiza-tion of an s, z, C, t transposer. LectureNotes in Computer Science, 2398:153–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980153.htm; http:/


series/0558/papers/2398/23980153.

pdf.

Oliveira:2002:MBS

[965] Flavio Oliveira, Iwao Kobayashi, andMitsumasa Sugawara. A multimediabased software for non-Japanese tolearn Japanese sign language. LectureNotes in Computer Science, 2398:162–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980162.htm; http:/


series/0558/papers/2398/23980162.

pdf.

Minagawa:2002:UID

[966] Hiroki Minagawa, Ichiro Naito, NobukoKato, Hiroshi Murakami, and Ya-sushi Ishihara. The user interfacedesign for the sign language trans-lator in a remote sign language in-terpretation system. Lecture Notesin Computer Science, 2398:164–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980164.htm; http:/


series/0558/papers/2398/23980164.

pdf.

Nishioka:2002:STH

[967] Tomoyuki Nishioka. The see-throughhead mount display as the informa-tion offering device for the hearingimpaired students. Lecture Notesin Computer Science, 2398:166–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980166.htm; http:/

REFERENCES 195


series/0558/papers/2398/23980166.

pdf.

Bauer:2002:DSS

[968] D. Bauer, A. Plinge, and M. Finke.Digital speech signal processing tocompensate severe sensory hearingdeficits: The /s, z, C, t/ trans-poser module in simulation — anoverview and examples. Lecture Notesin Computer Science, 2398:168–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980168.htm; http:/


series/0558/papers/2398/23980168.

pdf.

Session:2002:CDY

[969] Introduction to the Special The-matic Session. Computers for the devel-opment of young disabled children. Lec-ture Notes in Computer Science, 2398:170–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980170.htm; http:/


series/0558/papers/2398/23980170.

pdf.

Buaud:2002:MGV

[970] Aurelie Buaud, Harry Svensson, Do-minique Archambault, and DominiqueBurger. Multimedia games for vi-sually impaired children. LectureNotes in Computer Science, 2398:173–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2398/23980173.htm; http:/


series/0558/papers/2398/23980173.

pdf.

Panek:2002:TAM

[971] Paul Panek, Christian Beck, Ste-fan Mina, Gottfried Seisenbacher,and Wolfgang L. Zagler. Techni-cal assistance for motor- and multi-ple disabled children — some longterm experiences. Lecture Notesin Computer Science, 2398:181–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980181.htm; http:/


series/0558/papers/2398/23980181.

pdf.

Chu:2002:DAW

[972] Chi Nung Chu, Tien Yu Li, andMing Chung Chen. The design of anadaptive Web browser for young chil-dren with reading difficulties. LectureNotes in Computer Science, 2398:189–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980189.htm; http:/


series/0558/papers/2398/23980189.

pdf.

Hilden:2002:CAY

[973] Anita Hilden and Jenny Hammar-lund. Can all young disabled chil-dren play at the computer? Lecture

REFERENCES 196



bibs/2398/23980191.htm; http:/


series/0558/papers/2398/23980191.

pdf.

Dutot:2002:TLC

[974] Antoine Dutot, Damien Olivier, andDominique Archambault. TL a lan-guage to create games for visuallyimpaired children. Lecture Notesin Computer Science, 2398:193–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980193.htm; http:/


series/0558/papers/2398/23980193.

pdf.

Kawamoto:2002:PAS

[975] Hiroaki Kawamoto and YoshiyukiSankai. Power assist system HAL-3 for gait disorder person. LectureNotes in Computer Science, 2398:196–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980196.htm; http:/


series/0558/papers/2398/23980196.

pdf.

Wu:2002:CAA

[976] Ting-Fang Wu, Ling-Fu Meng, Hwa-Pey Wang, Wu-Tien Wu, and Tien-Yu Li. Computer access assess-

ment for persons with physical dis-abilities: A guide to assistive tech-nology interventions. Lecture Notesin Computer Science, 2398:204–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980204.htm; http:/


series/0558/papers/2398/23980204.

pdf.

Ohyama:2002:PEM

[977] Junji Ohyama and Yoshiyuki Sankai.A proposal of effective motion learn-ing method using sensory feedbackfor walk-disabled people. LectureNotes in Computer Science, 2398:212–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980212.htm; http:/


series/0558/papers/2398/23980212.

pdf.

Nozawa:2002:CMW

[978] Masako Nozawa and Yoshiyuki Sankai.Control method of walking speed andstep length for hybrid assistive leg. Lec-ture Notes in Computer Science, 2398:220–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980220.htm; http:/


series/0558/papers/2398/23980220.

pdf.

REFERENCES 197

Ikeuchi:2002:DGT

[979] Hidetaka Ikeuchi, Satoshi Arakane,Kengo Ohnishi, Keiji Imado, YukioSaito, and Hiroomi Miyagawa. The de-velopment of gait training system forcomputer-aided rehabilitation. LectureNotes in Computer Science, 2398:228–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980228.htm; http:/


series/0558/papers/2398/23980228.

pdf.

Gips:2002:AIC

[980] James Gips, Philip A. DiMattia,Marialice Curran, Debra Lees, andMaureen Gates. Accessing Inter-net courses by eye movement andhead movement. Lecture Notesin Computer Science, 2398:236–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980236.htm; http:/


series/0558/papers/2398/23980236.

pdf.

Li:2002:PIW

[981] Tien yu Li, Ling-Fu Meng, Chien-Huey Sophie Chang, Ming-ChungChen, Chi-Nung Chu, Arr-Ming Chou,Tony Yang, Chin-Chen Hui, Ai-ChiaoKu, and Yun-Lung Lin. The pro-gram for improving the working in-terfaces and increasing the work com-petencies of people with severe phys-ical disabilities: The evaluation, de-sign, and training of the adaptive

computer devices. Lecture Notesin Computer Science, 2398:238–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980238.htm; http:/


series/0558/papers/2398/23980238.

pdf.

Session:2002:MTP

[982] Introduction to the Special The-matic Session. Matching typing per-sons and intelligent interfaces. LectureNotes in Computer Science, 2398:241–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980241.htm; http:/


series/0558/papers/2398/23980241.

pdf.

Matiasek:2002:FML

[983] Johannes Matiasek, Marco Baroni, andHarald Trost. FASTY — A multi-lingual approach to text prediction.Lecture Notes in Computer Science,2398:243–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980243.htm; http:


series/0558/papers/2398/23980243.

pdf.

Willis:2002:IFA

[984] Tim Willis, Helen Pain, Shari Trewin,and Stephen Clark. Informing flex-ible abbreviation expansion for users

REFERENCES 198

with motor disabilities. Lecture Notesin Computer Science, 2398:251–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980251.htm; http:/


series/0558/papers/2398/23980251.

pdf.

Evreinov:2002:CIC

[985] Grigori Evreinov and Roope Raisamo.Cyclic input of characters through asingle button manipulation. LectureNotes in Computer Science, 2398:259–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980259.htm; http:/


series/0558/papers/2398/23980259.

pdf.

Lauruska:2002:DPC

[986] Vidas Lauruska and Tomas Musteikis.Developing of predictive communi-cation system for the physicallydisabled people. Lecture Notesin Computer Science, 2398:267–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980267.htm; http:/


series/0558/papers/2398/23980267.

pdf.

Chen:2002:TAD

[987] Ming-Chung Chen, Hwa-Pey Wang,and Tien-Yu Li. Teaching adoles-

cents with disabilities to learn Chi-nese keyboarding by using multime-dia computer assisted input methodlearning system. Lecture Notesin Computer Science, 2398:271–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980271.htm; http:/


series/0558/papers/2398/23980271.

pdf.

Trewin:2002:AAS

[988] Shari Trewin, Patti Slobogin, andM. G. Power. Accelerating assessmentwith self-optimizing devices. LectureNotes in Computer Science, 2398:273–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980273.htm; http:/


series/0558/papers/2398/23980273.

pdf.

Boissiere:2002:PEF

[989] Philippe Boissiere and Daniel Dours.A proposal of an evaluation frameworkfor writing assistance systems: Ap-plication to VITIPI. Lecture Notesin Computer Science, 2398:276–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980276.htm; http:/


series/0558/papers/2398/23980276.

pdf.

REFERENCES 199

Clemens:2002:IAT

[990] Dirk Clemens, Helmut Heck, MichaelKuhn, Olaf Perlick, and FrankReins. Individually assisted textentry with situational and contex-tual prediction. Lecture Notesin Computer Science, 2398:279–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980279.htm; http:/


series/0558/papers/2398/23980279.

pdf.

Session:2002:ADM

[991] Introduction to the Special The-matic Session. Accessible digital media.Lecture Notes in Computer Science,2398:282–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980282.htm; http:


series/0558/papers/2398/23980282.

pdf.

Roberts:2002:MIE

[992] Vera Roberts and Deborah Fels.Methods for inclusion: Employingthink aloud protocol with individ-uals who are deaf. Lecture Notesin Computer Science, 2398:284–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980284.htm; http:/


series/0558/papers/2398/23980284.

pdf.

Silverman:2002:ECD

[993] Charles Silverman and Deborah I. Fels.Emotive captioning in a digital world.Lecture Notes in Computer Science,2398:292–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980292.htm; http:


series/0558/papers/2398/23980292.

pdf.

Verboom:2002:SSM

[994] Maarten Verboom, David Crombie,Evelien Dijk, and Mildred Theunisz.Spoken subtitles: Making subtitledTV programmes accessible. LectureNotes in Computer Science, 2398:295–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980295.htm; http:/


series/0558/papers/2398/23980295.

pdf.

Fels:2002:ADM

[995] Deborah I. Fels. Accessible digitalmedia. Lecture Notes in ComputerScience, 2398:303–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2398/23980303.



2398/23980303.pdf.

Session:2002:EVL

[996] Introduction to the Special The-matic Session. Electronic and vir-

REFERENCES 200

tual libraries: Access for printdisabled people. Lecture Notesin Computer Science, 2398:308–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980308.htm; http:/


series/0558/papers/2398/23980308.

pdf.

Kerscher:2002:SRM

[997] George Kerscher. Semantically richmarkup, should you be agnostic inyour choice of a vocabulary. LectureNotes in Computer Science, 2398:312–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980312.htm; http:/


series/0558/papers/2398/23980312.

pdf.

Kahlisch:2002:DGL

[998] Thomas Kahlisch. DZB — A Germanlibrary for the blind goes digital. Lec-ture Notes in Computer Science, 2398:316–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980316.htm; http:/


series/0558/papers/2398/23980316.

pdf.

Hammerschmid:2002:HCL

[999] Ruth Hammerschmid, Klaus Miesen-berger, and Bernhard Stoger. Harmon-isation of the copyright law through-

out the European Union — A challengefor all print disabled people. LectureNotes in Computer Science, 2398:321–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980321.htm; http:/


series/0558/papers/2398/23980321.

pdf.

Moulin:2002:DDO

[1000] Claude Moulin, Sylvain Giroux, Do-minique Archambault, Davide Car-boni, and Dominique Burger. Adistributed document oriented archi-tecture for rendering services to vi-sually impaired students. LectureNotes in Computer Science, 2398:329–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980329.htm; http:/


series/0558/papers/2398/23980329.

pdf.

Taha:2002:AVL

[1001] Karim Taha and Lori Stefano Pertucci.ABA’s virtual library services for blindand visually impaired people. LectureNotes in Computer Science, 2398:337–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980337.htm; http:/


series/0558/papers/2398/23980337.

pdf.

REFERENCES 201

Sable:2002:LPL

[1002] Sebastien Sable and Dominique Ar-chambault. Libbraille: A portable li-brary to easily access Braille displays.Lecture Notes in Computer Science,2398:345–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980345.htm; http:


series/0558/papers/2398/23980345.

pdf.

Raynal:2002:CHB

[1003] Mathieu Raynal and Mathieu Ser-rurier. CYNTHIA: An HTML browserfor visually handicapped people. Lec-ture Notes in Computer Science, 2398:353–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980353.htm; http:/


series/0558/papers/2398/23980353.

pdf.

Guillon:2002:SIS

[1004] Benoit Guillon, Dominique Burger,and Bruno Marmol. A secure In-ternet service for delivering docu-ments for the blind. Lecture Notesin Computer Science, 2398:360–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980360.htm; http:/


series/0558/papers/2398/23980360.

pdf.

Kottstorfer:2002:VLI

[1005] Marco Kottstorfer and Klaus Miesen-berger. Virtual libraries initia-tives with usable results for printdisabled people. Lecture Notesin Computer Science, 2398:366–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980366.htm; http:/


series/0558/papers/2398/23980366.

pdf.

Crombie:2002:UDB

[1006] David Crombie, Arne Leeman, Mar-ian Oosting, and Maarten Verboom.Unlocking doors: Building an accessi-ble online information node. LectureNotes in Computer Science, 2398:374–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980374.htm; http:/


series/0558/papers/2398/23980374.

pdf.

Paepen:2002:UXR

[1007] Bert Paepen and Jan Engelen. Us-ing XML as a reading enabler forvisually impaired persons. LectureNotes in Computer Science, 2398:382–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980382.htm; http:/


series/0558/papers/2398/23980382.

pdf.

REFERENCES 202

Schmetzke:2002:AOL

[1008] Axel Schmetzke. The accessibilityof online library resources for peo-ple with print disabilities: Researchand strategies for change. LectureNotes in Computer Science, 2398:390–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980390.htm; http:/


series/0558/papers/2398/23980390.

pdf.

Vincent:2002:QAD

[1009] Brasseur Vincent, Mohamed Slimane,Nicole Vincent, and Dominique Burger.Quick access to dictionaries for blindand visually impaired people. LectureNotes in Computer Science, 2398:398–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980398.htm; http:/


series/0558/papers/2398/23980398.

pdf.

Jaworek:2002:PPA

[1010] Gerhard Jaworek. Perspectives andpossibilities for the automated pro-cessing of scientific texts for blindand visually impaired people. LectureNotes in Computer Science, 2398:401–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980401.htm; http:/


series/0558/papers/2398/23980401.

pdf.

Patil:2002:UUI

[1011] Basawaraj Patil, Klaus Maetzel, andErich J. Neuhold. Universal usabil-ity issues of textual information struc-tures, commands, and languages ofnative visually challenged users: Aninclusive design framework. LectureNotes in Computer Science, 2398:403–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980403.htm; http:/


series/0558/papers/2398/23980403.

pdf.

DeMeglio:2002:AID

[1012] Marisa DeMeglio, Markku T. Hakki-nen, and Hiroshi Kawamura. Acces-sible interface design: Adaptive mul-timedia information system (AMIS).Lecture Notes in Computer Science,2398:406–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980406.htm; http:


series/0558/papers/2398/23980406.

pdf.

Petrie:2002:RMD

[1013] Helen Petrie and Gerhard Weber.Reading multimedia documents. Lec-ture Notes in Computer Science, 2398:413–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 203

bibs/2398/23980413.htm; http:/


series/0558/papers/2398/23980413.

pdf.

Bellik:2002:CVI

[1014] Yacine Bellik and Rene Farcy. Com-parison of various interface modalitiesfor a locomotion assistance device. Lec-ture Notes in Computer Science, 2398:421–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980421.htm; http:/


series/0558/papers/2398/23980421.

pdf.

Guillet:2002:PHV

[1015] Vivien Guillet, Beatrice Rumpler, andJean-Marie Pinon. Providing help forvisually impaired people’s navigation inan urban environment using GPS. Lec-ture Notes in Computer Science, 2398:429–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980429.htm; http:/


series/0558/papers/2398/23980429.

pdf.

Al-Salman:2002:NTD

[1016] AbdulMalik S. Al-Salman. New trendsand developments in computer andInternet technology for visually im-paired people: A survey and useful-ness in the Arab sub-region. LectureNotes in Computer Science, 2398:437–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2398/23980437.htm; http:/


series/0558/papers/2398/23980437.

pdf.

Schwende:2002:AEA

[1017] Harald Schwende. Auditory emotionalaccess to visual information. LectureNotes in Computer Science, 2398:445–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980445.htm; http:/


series/0558/papers/2398/23980445.

pdf.

Nomura:2002:ASA

[1018] Yoshihiko Nomura, Sayuri Nishihama,Tokuhiro Sugiura, Hirokazu Matsui,and Norihiko Kato. Auditory sen-sation aided image perception: In-tegration of somesthetic sense offingertip position. Lecture Notesin Computer Science, 2398:448–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980448.htm; http:/


series/0558/papers/2398/23980448.

pdf.

Silva:2002:NAA

[1019] Luciano Silva and Olga Regina PereiraBellon. A novel application to aidlow vision computer users. LectureNotes in Computer Science, 2398:455–??, 2002. CODEN LNCSD9. ISSN

REFERENCES 204



bibs/2398/23980455.htm; http:/


series/0558/papers/2398/23980455.

pdf.

Jung:2002:VIP

[1020] Martin Jung and Erdmuthe Meyerzu Bexten. Visually impaired per-sons using Microsoft PowerPoint pre-sentations. Lecture Notes in ComputerScience, 2398:463–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2398/23980463.



2398/23980463.pdf.

Gilden:2002:UMO

[1021] Deborah Gilden. Using MS Of-fice features as low vision ac-cessibility tools. Lecture Notesin Computer Science, 2398:469–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980469.htm; http:/


series/0558/papers/2398/23980469.

pdf.

Session:2002:AMB

[1022] Introduction to the Special The-matic Session. Access to mathe-matics by blind students. LectureNotes in Computer Science, 2398:471–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2398/23980471.htm; http:/


series/0558/papers/2398/23980471.

pdf.

Karshmer:2002:AAB

[1023] Arthur I. Karshmer, Gopal Gupta,and Doug Gillan. Architecting an au-ditory browser for navigating math-ematical expressions. Lecture Notesin Computer Science, 2398:477–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980477.htm; http:/


series/0558/papers/2398/23980477.

pdf.

Gaura:2002:RRE

[1024] Pavel Gaura. REMathEx — readerand editor of the mathematical ex-pressions for blind students. LectureNotes in Computer Science, 2398:486–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980486.htm; http:/


series/0558/papers/2398/23980486.

pdf.

Fitzpatrick:2002:STD

[1025] D. Fitzpatrick. Speaking technical doc-uments: Using prosody to convey tex-tual and mathematical material. Lec-ture Notes in Computer Science, 2398:494–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 205



bibs/2398/23980494.htm; http:/


series/0558/papers/2398/23980494.

pdf.

Gardner:2002:ABS

[1026] John A. Gardner. Access by blindstudents and professionals to main-stream math and science. LectureNotes in Computer Science, 2398:502–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980502.htm; http:/


series/0558/papers/2398/23980502.

pdf.

MeyerzuBexten:2002:LUA

[1027] Erdmuthe Meyer zu Bexten and Mar-tin Jung. LATEX at the Universityof Applied Sciences Giessen-Friedberg— experiences at the Institute forVisually Impaired Students. LectureNotes in Computer Science, 2398:508–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980508.htm; http:/


series/0558/papers/2398/23980508.

pdf.

Kobolkova:2002:EAM

[1028] Martina Kobolkova and Peter Lecky.Experience with access to mathemat-ics for blind students in Slovakia. Lec-ture Notes in Computer Science, 2398:510–??, 2002. CODEN LNCSD9. ISSN



bibs/2398/23980510.htm; http:/


series/0558/papers/2398/23980510.

pdf.

Toshihiro:2002:IAT

[1029] Kanahori Toshihiro and Suzuki Masakazu.Infty alpha test site. Lecture Notesin Computer Science, 2398:512–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980512.htm; http:/


series/0558/papers/2398/23980512.

pdf.

Chen:2002:DAP

[1030] Ming Chung Chen, Tien Yu Li,Chi Nung Chu, Ling Fu Meng, Chien-Huey Sophie Chang, Arr Mien Chou,Tony Yang, Chih Chen Hui, Ai ChiaoKu, and Yun Lung Lin. Design-ing an AutoMouse to promote com-puter accessibility for people with se-vere physical impairments. LectureNotes in Computer Science, 2398:514–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980514.htm; http:/


series/0558/papers/2398/23980514.

pdf.

Ault:2002:ELD

[1031] H. K. Ault, J. W. Deloge, R. W.Lapp, M. J. Morgan, and J. R. Bar-

REFERENCES 206

nett. Evaluation of long descrip-tions of statistical graphics for blindand low vision Web users. LectureNotes in Computer Science, 2398:517–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980517.htm; http:/


series/0558/papers/2398/23980517.

pdf.

Kobayashi:2002:TDS

[1032] Makoto Kobayashi and TetsuyaWatanabe. A tactile display sys-tem equipped with a pointing de-vice — MIMIZU. Lecture Notesin Computer Science, 2398:527–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980527.htm; http:/


series/0558/papers/2398/23980527.

pdf.

Batusic:2002:PTG

[1033] Mario Batusic and Franz Urban.Preparing tactile graphics for tra-ditional Braille printers with Brl-GraphEditor. Lecture Notes in Com-puter Science, 2398:535–??, 2002. CO-DEN LNCSD9. ISSN 0302-9743(print), 1611-3349 (electronic). URLhttp://link.springer-ny.com/link/




2398/23980535.pdf.

Petrie:2002:TSP

[1034] Helen Petrie, Christoph Schlieder, PaulBlenkhorn, Gareth Evans, AlasdairKing, Anne-Marie O’Neill, George T.Ioannidis, Blaithin Gallagher, DavidCrombie, Rolf Mager, and MaurizioAlafaci. TeDUB: A system for pre-senting and exploring technical draw-ings for blind people. Lecture Notesin Computer Science, 2398:537–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980537.htm; http:/


series/0558/papers/2398/23980537.

pdf.

Shimizu:2002:IUI

[1035] Yutaka Shimizu, Masami Shino-hara, Hideji Nagaoka, and YasushigeYonezawa. Improvement of user in-terface for blind PC users. LectureNotes in Computer Science, 2398:540–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980540.htm; http:/


series/0558/papers/2398/23980540.

pdf.

Graupp:2002:HPP

[1036] Helen Graupp, Keith Gladstone, andLeanne Thompson. Haptic percep-tion of 2D pictures and 3D objects:Accurate mental representation as afunction of visual status. LectureNotes in Computer Science, 2398:543–??, 2002. CODEN LNCSD9. ISSN

REFERENCES 207



bibs/2398/23980543.htm; http:/


series/0558/papers/2398/23980543.

pdf.

Enikov:2002:MMS

[1037] Eniko T. Enikov, Kalin V. Lazarov,and Gilbert R. Gonzales. Microelec-trical mechanical systems actuator ar-ray for tactile communication. LectureNotes in Computer Science, 2398:551–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980551.htm; http:/


series/0558/papers/2398/23980551.

pdf.

Challis:2002:DIT

[1038] Ben Challis. Designing interac-tive tactile diagrams. Lecture Notesin Computer Science, 2398:559–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980559.htm; http:/


series/0558/papers/2398/23980559.

pdf.

Murphy:2002:AC

[1039] Damian T. Murphy, Michael C. Kelly,and Anthony I. Tew. 3D audioin the 21st century. Lecture Notesin Computer Science, 2398:562–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2398/23980562.htm; http:/


series/0558/papers/2398/23980562.

pdf.

Krueger:2002:GPS

[1040] Myron W. Krueger and Debo-rah Gilden. Going places with“KnowWare”: Virtual reality mapsfor blind people. Lecture Notesin Computer Science, 2398:565–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980565.htm; http:/


series/0558/papers/2398/23980565.

pdf.

Kurniawan:2002:MMB

[1041] Sri Hastuti Kurniawan and AlistairSutcliffe. Mental models of blind usersin the Windows environment. LectureNotes in Computer Science, 2398:568–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980568.htm; http:/


series/0558/papers/2398/23980568.

pdf.

Evans:2002:APN

[1042] D. G. Evans, K. Polyzoaki, andP. Blenkhorn. An approach to pro-ducing new languages for talking ap-plications for use by blind people. Lec-ture Notes in Computer Science, 2398:575–??, 2002. CODEN LNCSD9. ISSN

REFERENCES 208



bibs/2398/23980575.htm; http:/


series/0558/papers/2398/23980575.

pdf.

Fisher:2002:URT

[1043] Wendy Fisher and Helen Petrie. Userrequirements for technologies for per-sonal communication and informationuse for deafblind people. LectureNotes in Computer Science, 2398:583–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980583.htm; http:/


series/0558/papers/2398/23980583.

pdf.

Butorac:2002:PIW

[1044] Danko Butorac. Project IPSIS — Webportal and Linux for the blind. Lec-ture Notes in Computer Science, 2398:585–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980585.htm; http:/


series/0558/papers/2398/23980585.

pdf.

Diggle:2002:ALE

[1045] T. Diggle, S. Kurniawan, D. G. Evans,and P. Blenkhorn. An analysis of lay-out errors in word processed documentsproduced by blind people. LectureNotes in Computer Science, 2398:587–??, 2002. CODEN LNCSD9. ISSN



bibs/2398/23980587.htm; http:/


series/0558/papers/2398/23980587.

pdf.

Watanabe:2002:WSR

[1046] Tetsuya Watanabe, Chuji Sashida,and Shinichi Okada. Windows screenreader user survey in Japan. LectureNotes in Computer Science, 2398:589–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980589.htm; http:/


series/0558/papers/2398/23980589.

pdf.

Evans:2002:TCD

[1047] D. G. Evans and P. Blenkhorn. Toolsfor creating documents in ‘preferredformat’ for visually impaired people.Lecture Notes in Computer Science,2398:591–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980591.htm; http:


series/0558/papers/2398/23980591.

pdf.

Hara:2002:BPS

[1048] Shunsuke Hara, Ryoko Kawamitsu,Kanako Kusunoki, Hiroshi Sato,and Mamoru Fujiyoshi. Brailleprinting system. Lecture Notesin Computer Science, 2398:594–??,2002. CODEN LNCSD9. ISSN

REFERENCES 209



bibs/2398/23980594.htm; http:/


series/0558/papers/2398/23980594.

pdf.

Blomquist:2002:BCW

[1049] Mats Blomquist. Braille contrac-tions in WinBraille. Lecture Notesin Computer Science, 2398:602–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980602.htm; http:/


series/0558/papers/2398/23980602.

pdf.

Arato:2002:BTT

[1050] Andras Arato, Theresa Vaspori,Gareth Evans, and Paul Blenkhorn.Braille to text translation for Hun-garian. Lecture Notes in ComputerScience, 2398:610–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2398/23980610.



2398/23980610.pdf.

Blomquist:2002:WAP

[1051] Mats Blomquist and Per Burman.The WinBraille approach to produc-ing Braille quickly and effectively. Lec-ture Notes in Computer Science, 2398:618–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980618.htm; http:/


series/0558/papers/2398/23980618.

pdf.

Takahashi:2002:HDS

[1052] Yoshiyuki Takahashi, Takafumi Ter-ada, Kaoru Inoue, Satoshi Sasada, andTakashi Komeda. Haptic device sys-tem for upper limb motor function andcognitive function rehabilitation. Lec-ture Notes in Computer Science, 2398:620–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980620.htm; http:/


series/0558/papers/2398/23980620.

pdf.

Mannikko-Barbutiu:2002:NAE

[1053] Sirkku Mannikko-Barbutiu. Network-ing for accessibility: Elderly peo-ple and new technology. LectureNotes in Computer Science, 2398:628–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980628.htm; http:/


series/0558/papers/2398/23980628.

pdf.

Panek:2002:THR

[1054] Paul Panek, Christian Beck, AndreasHochgatterer, Stefan Mina, BarbaraPrazak, Gottfried Seisenbacher, Math-ijs Soede, and Wolfgang L. Zagler. Tele-help and remote service provision us-ing RESORT prototype system. Lec-

REFERENCES 210



bibs/2398/23980635.htm; http:/


series/0558/papers/2398/23980635.

pdf.

Treviranus:2002:MYH

[1055] Jutta Treviranus. Making your-self at home — portable personalaccess preferences. Lecture Notesin Computer Science, 2398:643–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980643.htm; http:/


series/0558/papers/2398/23980643.

pdf.

Mayer:2002:EPS

[1056] Peter Mayer, Georg Edelmayer,and Wolfgang L. Zagler. EUproject SILC — personal bio-sensorbased alarm system. Lecture Notesin Computer Science, 2398:649–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980649.htm; http:/


series/0558/papers/2398/23980649.

pdf.

Tollefsen:2002:VUA

[1057] Morten Tollefsen and Magne Lunde.Videophones: Useful assistive devicesfor visually impaired persons? Lec-



bibs/2398/23980657.htm; http:/


series/0558/papers/2398/23980657.

pdf.

Leloup:2002:HSM

[1058] Jerome Leloup and Pierre Gaucher.HMPH — “Habitat Mobile pour Per-sonnes Handicapees” — software forthe design of an adapted living area.Lecture Notes in Computer Science,2398:659–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980659.htm; http:


series/0558/papers/2398/23980659.

pdf.

James:2002:SIL

[1059] Diana P. James. “Bonkers”. in-creasing literacy skills: An eclec-tic electronic teaching approachgone “Bonkers”. Lecture Notesin Computer Science, 2398:662–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980662.htm; http:/


series/0558/papers/2398/23980662.

pdf.

Session:2002:AM

[1060] Introduction to the Special The-matic Session. Access music. Lecture

REFERENCES 211



bibs/2398/23980665.htm; http:/


series/0558/papers/2398/23980665.

pdf.

Crombie:2002:SME

[1061] David Crombie, Sijo Dijkstra, EdmarSchut, and Natasha Lindsay. Spo-ken music: Enhancing access to mu-sic for the print disabled. LectureNotes in Computer Science, 2398:667–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980667.htm; http:/


series/0558/papers/2398/23980667.

pdf.

Ronch:2002:MSR

[1062] Angelo Da Ronch and AdrianoBlason. A music score recog-niser for the blind. Lecture Notesin Computer Science, 2398:675–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980675.htm; http:/


series/0558/papers/2398/23980675.

pdf.

Evreinova:2002:VMN

[1063] Tatiana Evreinova and Roope Raisamo.Visualization of music notation forpartially sighted persons. Lecture



bibs/2398/23980682.htm; http:/


series/0558/papers/2398/23980682.

pdf.

Murphy:2002:ASS

[1064] Damian T. Murphy and Mark A. Hil-dred. Accessing the software studio.Lecture Notes in Computer Science,2398:684–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980684.htm; http:


series/0558/papers/2398/23980684.

pdf.

Chamberlain:2002:ODI

[1065] Helen Chamberlain. Opening doorsto information technology — sec-tion 508 of the US rehabilita-tion act of 1973. Lecture Notesin Computer Science, 2398:686–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980686.htm; http:/


series/0558/papers/2398/23980686.

pdf.

Cameron:2002:ANA

[1066] Zachariah Cameron. Access: TheNorth American experience of leg-islating attitudes. Lecture Notesin Computer Science, 2398:692–??,

REFERENCES 212



bibs/2398/23980692.htm; http:/


series/0558/papers/2398/23980692.

pdf.

Viglas:2002:OMT

[1067] Constantinos Viglas and GeorgiosKouroupetroglou. An open machinetranslation system for augmentativeand alternative communication. Lec-ture Notes in Computer Science, 2398:699–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980699.htm; http:/


series/0558/papers/2398/23980699.

pdf.

Kowalik:2002:CLD

[1068] Ryszard Kowalik. Capabilities andlimitations of the disabled in remoteaccess to information. Lecture Notesin Computer Science, 2398:707–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980707.htm; http:/


series/0558/papers/2398/23980707.

pdf.

Iversen:2002:IEI

[1069] Charmaine Mueller Iversen. IMPACT:An example of information, aware-ness, and legislation, leading towarda more accessible workplace. Lecture



bibs/2398/23980709.htm; http:/


series/0558/papers/2398/23980709.

pdf.

Session:2002:ICF

[1070] Introduction to the Special The-matic Session. IT-certificates to fos-ter the vocational integration of peoplewith disabilities: ECDL(R)PD. Lec-ture Notes in Computer Science, 2398:712–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980712.htm; http:/


series/0558/papers/2398/23980712.

pdf.

Tollefsen:2002:EVI

[1071] Morten Tollefsen and Magne Lunde.ECDL for visually impaired persons:Learning materials, individual train-ing, and distance education. LectureNotes in Computer Science, 2398:715–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980715.htm; http:/


series/0558/papers/2398/23980715.

pdf.

Petz:2002:EPU

[1072] Andrea Petz and Klaus Miesen-berger. ECDL(R) PD — using a

REFERENCES 213

well known standard to lift barri-ers on the labour market. LectureNotes in Computer Science, 2398:723–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980723.htm; http:/


series/0558/papers/2398/23980723.

pdf.

Petz:2002:KKI

[1073] Andrea Petz. KISS — keep itshort and simple? Lecture Notesin Computer Science, 2398:731–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980731.htm; http:/


series/0558/papers/2398/23980731.

pdf.

Lunde:2002:MWE

[1074] Magne Lunde and Morten Tollef-sen. Many ways to ECDL. LectureNotes in Computer Science, 2398:734–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980734.htm; http:/


series/0558/papers/2398/23980734.

pdf.

Session:2002:SAM

[1075] Introduction to the Special The-matic Session. Studying and aca-demic mobility — IT support forstudents with disabilities. Lecture



bibs/2398/23980737.htm; http:/


series/0558/papers/2398/23980737.

pdf.

Petz:2002:DAS

[1076] Andrea Petz, Klaus Miesenberger, andBernhard Stoger. Developing aca-demic skills among print disabled stu-dents: IT based Austrian-wide net-work for service provision. LectureNotes in Computer Science, 2398:739–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980739.htm; http:/


series/0558/papers/2398/23980739.

pdf.

Arion:2002:ALA

[1077] Mirela Arion, Radu Ciupa, and Mar-ius Iulian Tutuianu. Access tolearning for all. Lecture Notesin Computer Science, 2398:747–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980747.htm; http:/


series/0558/papers/2398/23980747.

pdf.

Hecht:2002:EDP

[1078] Janice Hecht and Bogdan Zam-fir. The evolving door: Providing

REFERENCES 214

technology access for post-secondarystudents in a constantly changingtechnology-based culture. LectureNotes in Computer Science, 2398:749–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980749.htm; http:/


series/0558/papers/2398/23980749.

pdf.

Schmiedl:2002:TAT

[1079] Todd Schmiedl and S. L. Dyser.Taking assistive technology to thehighest degree. Lecture Notesin Computer Science, 2398:751–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980751.htm; http:/


series/0558/papers/2398/23980751.

pdf.

Katoh:2002:LEO

[1080] Hiroshi Katoh, Martin Pauly, Shun-suke Hara, Hideji Nagaoka, and KlausMiesenberger. Learning from eachother: Comparing the service provi-sion for blind and visually-impairedstudents in post-secondary educationin Japan and Europe. Lecture Notesin Computer Science, 2398:753–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980753.htm; http:/


series/0558/papers/2398/23980753.

pdf.

Kurniawan:2002:HAW

[1081] Sri H. Kurniawan. How accessibleare Web information resources forstudents with disabilities? LectureNotes in Computer Science, 2398:756–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980756.htm; http:/


series/0558/papers/2398/23980756.

pdf.

Roussel:2002:PAT

[1082] Calais Roussel. Providing assistivetechnology and alternate media in com-munity colleges: A case study. LectureNotes in Computer Science, 2398:758–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980758.htm; http:/


series/0558/papers/2398/23980758.

pdf.

Scherer:2002:ICI

[1083] Marcia J. Scherer. International col-laboration to improve assistive tech-nology outcomes. Lecture Notesin Computer Science, 2398:761–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980761.htm; http:/


REFERENCES 215

series/0558/papers/2398/23980761.

pdf.

Scherer:2002:SAT

[1084] Marcia J. Scherer. The studyof assistive technology outcomes inthe united states. Lecture Notesin Computer Science, 2398:764–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980764.htm; http:/


series/0558/papers/2398/23980764.

pdf.

Witte:2002:FCO

[1085] Luc P. de Witte, G. J. Gelderblom,and R. D. Wessels. Future challengesin AT outcome measurement. LectureNotes in Computer Science, 2398:772–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980772.htm; http:/


series/0558/papers/2398/23980772.

pdf.

Gelderblom:2002:EIA

[1086] G. J. Gelderblom, L. P. de Witte,and R. D. Wessels. European in-struments for assistive technology out-come assessment. Lecture Notesin Computer Science, 2398:777–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2398/23980777.htm; http:/


series/0558/papers/2398/23980777.

pdf.

Craddock:2002:IOM

[1087] Gerald Craddock. Implementing out-comes measurement in an assistivetechnology service delivery system.Lecture Notes in Computer Science,2398:782–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2398/23980782.htm; http:


series/0558/papers/2398/23980782.

pdf.

Anonymous:2002:AIaaaaf




Schiper:2002:FDV

[1089] Andre Schiper. Failure detec-tion vs group membership in fault-tolerant distributed systems: Hid-den trade-offs. Lecture Notesin Computer Science, 2399:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990001.htm; http:/


series/0558/papers/2399/23990001.

pdf.

REFERENCES 216

Sands:2002:PTC

[1090] David Sands. Probability and tim-ing: Challenges for secure program-ming (invited talk). Lecture Notesin Computer Science, 2399:16–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990016.htm; http:/


series/0558/papers/2399/23990016.

pdf.

Aldini:2002:SAP

[1091] Alessandro Aldini and Roberto Gorri-eri. Security analysis of a probabilis-tic non-repudiation protocol. LectureNotes in Computer Science, 2399:17–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990017.htm; http:/


series/0558/papers/2399/23990017.

pdf.

Bohnenkamp:2002:MVM

[1092] Henrik Bohnenkamp and BoudewijnHaverkort. The mean value ofthe maximum. Lecture Notesin Computer Science, 2399:37–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990037.htm; http:/


series/0558/papers/2399/23990037.

pdf.

DArgenio:2002:RRS

[1093] Pedro R. D’Argenio, Bertrand Jeannet,Henrik E. Jensen, and Kim G. Larsen.Reduction and refinement strategiesfor probabilistic analysis. LectureNotes in Computer Science, 2399:57–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990057.htm; http:/


series/0558/papers/2399/23990057.

pdf.

Fecher:2002:ARP

[1094] Harald Fecher, Mila Majster-Cederbaum,and Jinzhao Wu. Action refine-ment for probabilistic processes withtrue concurrency models. LectureNotes in Computer Science, 2399:77–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990077.htm; http:/


series/0558/papers/2399/23990077.

pdf.

Haar:2002:PUP

[1095] Stefan Haar. Probabilistic un-foldings and partial order fair-ness in petri nets. Lecture Notesin Computer Science, 2399:95–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990095.htm; http:/


series/0558/papers/2399/23990095.

pdf.

REFERENCES 217

Huth:2002:PPA

[1096] Michael Huth. Possibilistic and proba-bilistic abstraction-based model check-ing. Lecture Notes in Computer Sci-ence, 2399:115–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2399/23990115.



2399/23990115.pdf.

Kwiatkowska:2002:CSL

[1097] Marta Kwiatkowska and RashidMehmood. Out-of-core solution oflarge linear systems of equations aris-ing from stochastic modelling. LectureNotes in Computer Science, 2399:135–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990135.htm; http:/


series/0558/papers/2399/23990135.

pdf.

Kwiatkowska:2002:MCC

[1098] Marta Kwiatkowska, Gethin Norman,and Antonio Pacheco. Model check-ing CSL until formulae with ran-dom time bounds. Lecture Notesin Computer Science, 2399:152–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990152.htm; http:/


series/0558/papers/2399/23990152.

pdf.

Kwiatkowska:2002:PMC

[1099] Marta Kwiatkowska, Gethin Nor-man, and Jeremy Sproston. Prob-abilistic model checking of theIEEE 802.11 wireless local areanetwork protocol. Lecture Notesin Computer Science, 2399:169–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990169.htm; http:/


series/0558/papers/2399/23990169.

pdf.

Kuntz:2002:DSR

[1100] Matthias Kuntz and Markus Siegle.Deriving symbolic representations fromstochastic process algebras. LectureNotes in Computer Science, 2399:188–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990188.htm; http:/


series/0558/papers/2399/23990188.

pdf.

Bournez:2002:GEP

[1101] Olivier Bournez. A generalization ofequational proof theory? LectureNotes in Computer Science, 2399:207–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990207.htm; http:/


series/0558/papers/2399/23990207.

pdf.

REFERENCES 218

Bravetti:2002:IAS

[1102] Mario Bravetti. An integrated ap-proach for the specification and anal-ysis of stochastic real-time systems(short abstract). Lecture Notesin Computer Science, 2399:209–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990209.htm; http:/


series/0558/papers/2399/23990209.

pdf.

Pierro:2002:PAI

[1103] Alessandra Di Pierro and HerbertWiklicky. Probabilistic abstract in-terpretation and statistical testing(extended abstract). Lecture Notesin Computer Science, 2399:211–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990211.htm; http:/


series/0558/papers/2399/23990211.

pdf.

Lassaigne:2002:AVP

[1104] Richard Lassaigne and Sylvain Pey-ronnet. Approximate verification ofprobabilistic systems. Lecture Notesin Computer Science, 2399:213–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2399/23990213.htm; http:/


series/0558/papers/2399/23990213.

pdf.

Anonymous:2002:AIaaaag



papers/2399/23990215.pdf.

Choi:2002:OCW

[1106] Y. r. Choi, A. Garg, S. Rai, J. Misra,and H. Vin. Orchestrating computa-tions on the World-Wide Web. Lec-ture Notes in Computer Science, 2400:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000001.htm; http:/


series/0558/papers/2400/24000001.

pdf.

Chalmers:2002:RRR

[1107] A. Chalmers and K. Cater. Real-istic rendering in real-time. LectureNotes in Computer Science, 2400:21–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000021.htm; http:/


series/0558/papers/2400/24000021.

pdf.

Benveniste:2002:NMN

[1108] A. Benveniste. Non-massive, non-high performance, distributed com-puting: Selected issues. LectureNotes in Computer Science, 2400:29–??, 2002. CODEN LNCSD9. ISSN

REFERENCES 219



bibs/2400/24000029.htm; http:/


series/0558/papers/2400/24000029.

pdf.

Feitelson:2002:FFF

[1109] D. G. Feitelson. The forgotten factor:Facts on performance evaluation andits dependence on workloads. LectureNotes in Computer Science, 2400:49–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000049.htm; http:/


series/0558/papers/2400/24000049.

pdf.

Khosla:2002:SNP

[1110] P. K. Khosla. Sensor networks —promise and challenges. LectureNotes in Computer Science, 2400:61–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000061.htm; http:/


series/0558/papers/2400/24000061.

pdf.

Reinefeld:2002:CTW

[1111] A. Reinefeld and F. Schintke. Con-cepts and technologies for a world-wide Grid infrastructure. LectureNotes in Computer Science, 2400:62–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000062.htm; http:/


series/0558/papers/2400/24000062.

pdf.

Bubak:2002:STE

[1112] M. Bubak and T. Ludwig. Sup-port tools and environments. LectureNotes in Computer Science, 2400:73–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000073.htm; http:/


series/0558/papers/2400/24000073.

pdf.

Truong:2002:SPA

[1113] H.-L. Truong and T. Fahringer.SCALEA: A performance analy-sis tool for distributed and par-allel programs. Lecture Notesin Computer Science, 2400:75–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000075.htm; http:/


series/0558/papers/2400/24000075.

pdf.

Roth:2002:DSH

[1114] P. C. Roth and B. P. Miller. Deepstart: A hybrid strategy for automatedperformance problem searches. LectureNotes in Computer Science, 2400:86–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 220

bibs/2400/24000086.htm; http:/


series/0558/papers/2400/24000086.

pdf.

Freitag:2002:STM

[1115] F. Freitag, J. Caubet, and J. Labarta.On the scalability of tracing mech-anisms. Lecture Notes in ComputerScience, 2400:97–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2400/24000097.



2400/24000097.pdf.

Hey:2002:CBP

[1116] A. J. G. Hey, J. Papay, A. J. Keane,and S. J. Cox. Component basedproblem solving environment. LectureNotes in Computer Science, 2400:105–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000105.htm; http:/


series/0558/papers/2400/24000105.

pdf.

Kovacs:2002:ITA

[1117] J. Kovacs, G. Kusper, R. Lovas, andW. Schreiner. Integrating temporal as-sertions into a parallel debugger. Lec-ture Notes in Computer Science, 2400:113–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000113.htm; http:/


series/0558/papers/2400/24000113.

pdf.

Nonaka:2002:LCH

[1118] J. Nonaka, G. H. Pfitscher, K. On-isi, and H. Nakano. Low-costhybrid internal clock synchroniza-tion mechanism for COTS PC clus-ter (research note). Lecture Notesin Computer Science, 2400:121–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000121.htm; http:/


series/0558/papers/2400/24000121.

pdf.

Nebro:2002:NPI

[1119] A. J. Nebro, E. Alba, F. Luna,and J. M. Troya. .NET as a plat-form for implementing concurrent ob-jects (research note). Lecture Notesin Computer Science, 2400:125–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000125.htm; http:/


series/0558/papers/2400/24000125.

pdf.

Miller:2002:PEA

[1120] B. P. Miller, J. Labarta, F. Schintke,and J. Simon. Performance evalua-tion, analysis and optimization. Lec-ture Notes in Computer Science, 2400:131–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 221

bibs/2400/24000131.htm; http:/


series/0558/papers/2400/24000131.

pdf.

Dementiev:2002:PMS

[1121] R. Dementiev, M. Klein, and W. J.Paul. Performance of MP3D on the SB-PRAM prototype (research note). Lec-ture Notes in Computer Science, 2400:132–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000132.htm; http:/


series/0558/papers/2400/24000132.

pdf.

Cohen:2002:MPP

[1122] A. Cohen, D. Genius, A. Kor-tebi, Z. Chamski, M. Duranton, andP. Feautrier. Multi-periodic processnetworks: Prototyping and verifyingstream-processing systems. LectureNotes in Computer Science, 2400:137–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000137.htm; http:/


series/0558/papers/2400/24000137.

pdf.

Gemund:2002:SCE

[1123] A. J. C. van Gemund. Symbolic costestimation of parallel applications. Lec-ture Notes in Computer Science, 2400:147–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000147.htm; http:/


series/0558/papers/2400/24000147.

pdf.

Baker:2002:PMI

[1124] Z. K. Baker and V. K. Prasanna. Per-formance modeling and interpretivesimulation of PIM architectures andapplications (research note). LectureNotes in Computer Science, 2400:157–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000157.htm; http:/


series/0558/papers/2400/24000157.

pdf.

Bane:2002:EOA

[1125] M. K. Bane and G. D. Riley. Ex-tended overhead analysis for OpenMP(research note). Lecture Notesin Computer Science, 2400:162–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000162.htm; http:/


series/0558/papers/2400/24000162.

pdf.

DeRose:2002:CCG

[1126] L. DeRose and F. Wolf. CATCH— A call-graph based automatictool for capture of hardware per-formance metrics for MPI andOpenMP applications. Lecture Notesin Computer Science, 2400:167–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 222



bibs/2400/24000167.htm; http:/


series/0558/papers/2400/24000167.

pdf.

Berg:2002:SPT

[1127] E. Berg and E. Hagersten. SIP:Performance tuning through sourcecode interdependence. Lecture Notesin Computer Science, 2400:177–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000177.htm; http:/


series/0558/papers/2400/24000177.

pdf.

Drozdowski:2002:SLB

[1128] M. Drozdowski, I. Milis, L. Rudolph,and D. Trystram. Scheduling andload balancing. Lecture Notesin Computer Science, 2400:187–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000187.htm; http:/


series/0558/papers/2400/24000187.

pdf.

Lowe:2002:STG

[1129] W. Lowe and W. Zimmermann.On scheduling task-graphs to LogP-machines with disturbances. LectureNotes in Computer Science, 2400:189–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000189.htm; http:/


series/0558/papers/2400/24000189.

pdf.

Altilar:2002:OSA

[1130] D. T. Altilar and Y. Paker. Optimalscheduling algorithms for communica-tion constrained parallel processing.Lecture Notes in Computer Science,2400:197–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2400/24000197.htm; http:


series/0558/papers/2400/24000197.

pdf.

Krevat:2002:JSB

[1131] E. Krevat, J. G. Castanos, and J. E.Moreira. Job scheduling for the Blue-Gene/L system (research note). Lec-ture Notes in Computer Science, 2400:207–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000207.htm; http:/


series/0558/papers/2400/24000207.

pdf.

Solar:2002:ASP

[1132] M. Solar and M. Inostroza. An au-tomatic scheduler for parallel ma-chines (research note). Lecture Notesin Computer Science, 2400:212–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 223

bibs/2400/24000212.htm; http:/


series/0558/papers/2400/24000212.

pdf.

Angel:2002:NAR

[1133] E. Angel, E. Bampis, and R. Giroudeau.Non-approximability results for thehierarchical communication problemwith a bounded number of clusters.Lecture Notes in Computer Science,2400:217–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2400/24000217.htm; http:


series/0558/papers/2400/24000217.

pdf.

Fujimoto:2002:NAB

[1134] N. Fujimoto and K. Hagihara. Non-approximability of the bulk syn-chronous task scheduling problem. Lec-ture Notes in Computer Science, 2400:225–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000225.htm; http:/


series/0558/papers/2400/24000225.

pdf.

Gine:2002:ATS

[1135] F. Gine, F. Solsona, P. Hernandez, andE. Luque. Adjusting time slices to ap-ply coscheduling techniques in a non-dedicated NOW (research note). Lec-ture Notes in Computer Science, 2400:234–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000234.htm; http:/


series/0558/papers/2400/24000234.

pdf.

Fujita:2002:SDM

[1136] S. Fujita. A semi-dynamic multipro-cessor scheduling algorithm with anasymptotically optimal competitive ra-tio. Lecture Notes in Computer Sci-ence, 2400:240–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2400/24000240.



2400/24000240.pdf.

Yuan:2002:AGP

[1137] X. Yuan, C. Roig, A. Ripoll, M. A.Senar, F. Guirado, and E. Luque.AMEEDA: A general-purpose mappingtool for parallel applications on dedi-cated clusters (research note). LectureNotes in Computer Science, 2400:248–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000248.htm; http:/


series/0558/papers/2400/24000248.

pdf.

Griebl:2002:CHP

[1138] M. Griebl. Compilers for high per-formance (compilation and paral-lelization techniques). Lecture Notesin Computer Science, 2400:253–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 224



bibs/2400/24000253.htm; http:/


series/0558/papers/2400/24000253.

pdf.

Bouchebaba:2002:TMR

[1139] Y. Bouchebaba and F. Coelho. Tilingand memory reuse for sequencesof nested loops. Lecture Notesin Computer Science, 2400:255–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000255.htm; http:/


series/0558/papers/2400/24000255.

pdf.

Beyls:2002:RDB

[1140] K. Beyls and E. H. D’Hollander. Reusedistance-based cache hint selection.Lecture Notes in Computer Science,2400:265–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2400/24000265.htm; http:


series/0558/papers/2400/24000265.

pdf.

Martin:2002:ILP

[1141] M. J. Martın, D. E. Singh, J. Tourino,and F. F. Rivera. Improving local-ity in the parallelization of doacrossloops (research note). Lecture Notesin Computer Science, 2400:275–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000275.htm; http:/


series/0558/papers/2400/24000275.

pdf.

Thiyagalingam:2002:MLC

[1142] J. Thiyagalingam and P. H. J. Kelly.Is morton layout competitive for largetwo-dimensional arrays? LectureNotes in Computer Science, 2400:280–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000280.htm; http:/


series/0558/papers/2400/24000280.

pdf.

Arenaz:2002:TDC

[1143] M. Arenaz, J. Tourino, and R. Doallo.Towards detection of coarse-grain loop-level parallelism in irregular compu-tations. Lecture Notes in ComputerScience, 2400:289–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2400/24000289.



2400/24000289.pdf.

Vivien:2002:OFS

[1144] F. Vivien. On the optimality ofFeautrier’s scheduling algorithm. Lec-ture Notes in Computer Science, 2400:299–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000299.htm; http:/

REFERENCES 225


series/0558/papers/2400/24000299.

pdf.

Barthou:2002:ETS

[1145] D. Barthou, P. Feautrier, and X. Re-don. On the equivalence of twosystems of affine recurrence equa-tions (research note). Lecture Notesin Computer Science, 2400:309–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000309.htm; http:/


series/0558/papers/2400/24000309.

pdf.

Diessel:2002:THL

[1146] O. Diessel, U. Malik, and K. So. To-wards high-level specification, synthe-sis, and virtualization of programmablelogic designs (research note). LectureNotes in Computer Science, 2400:314–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000314.htm; http:/


series/0558/papers/2400/24000314.

pdf.

Kosch:2002:PDD

[1147] H. Kosch, D. Skilicorn, and D. Talia.Parallel and distributed databases,data mining and knowledge discovery.Lecture Notes in Computer Science,2400:319–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2400/24000319.htm; http:


series/0558/papers/2400/24000319.

pdf.

Martens:2002:DQS

[1148] H. Martens, E. Rahm, and T. Stohr.Dynamic query scheduling in paral-lel data warehouses. Lecture Notesin Computer Science, 2400:321–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000321.htm; http:/


series/0558/papers/2400/24000321.

pdf.

Smith:2002:SNR

[1149] J. Smith, P. Watson, S. de F. Mendes Sam-paio, and N. W. Paton. Speedingup navigational requests in a paral-lel object database system. LectureNotes in Computer Science, 2400:332–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000332.htm; http:/


series/0558/papers/2400/24000332.

pdf.

Bretschneider:2002:RMS

[1150] T. Bretschneider and O. Kao. Retrievalof multispectral satellite imagery oncluster architectures (research note).Lecture Notes in Computer Science,2400:342–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


REFERENCES 226

0558/bibs/2400/24000342.htm; http:


series/0558/papers/2400/24000342.

pdf.

Jin:2002:SMP

[1151] R. Jin and G. Agrawal. Shared mem-ory parallelization of decision treeconstruction using a general datamining middleware. Lecture Notesin Computer Science, 2400:346–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000346.htm; http:/


series/0558/papers/2400/24000346.

pdf.

Zhang:2002:CSD

[1152] Y. Zhang, A. Sivasubramaniam,J. Zhang, S. Nagar, and H. Franke.Characterizing the scalability ofdecision-support workloads on clus-ters and SMP systems. Lecture Notesin Computer Science, 2400:355–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000355.htm; http:/


series/0558/papers/2400/24000355.

pdf.

Kwok:2002:PFC

[1153] T. Kwok, K. Smith, S. Lozano, andD. Taniar. Parallel fuzzy c-means clus-tering for large data sets. LectureNotes in Computer Science, 2400:365–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2400/24000365.htm; http:/


series/0558/papers/2400/24000365.

pdf.

Orlando:2002:SHP

[1154] S. Orlando, P. Palmerini, R. Perego,and F. Silvestri. Scheduling highperformance data mining tasks ona data grid environment. LectureNotes in Computer Science, 2400:375–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000375.htm; http:/


series/0558/papers/2400/24000375.

pdf.

Boukerche:2002:DIR

[1155] A. Boukerche and T. Tuck. Adelayed-initiation risk-free multiver-sion temporally correct algorithm(research note). Lecture Notesin Computer Science, 2400:385–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000385.htm; http:/


series/0558/papers/2400/24000385.

pdf.

Mayr:2002:CTA

[1156] E. W. Mayr. Complexity the-ory and algorithms. Lecture Notesin Computer Science, 2400:391–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 227



bibs/2400/24000391.htm; http:/


series/0558/papers/2400/24000391.

pdf.

Tiskin:2002:PCH

[1157] A. Tiskin. Parallel convex hullcomputation by generalised reg-ular sampling. Lecture Notesin Computer Science, 2400:392–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000392.htm; http:/


series/0558/papers/2400/24000392.

pdf.

Niculescu:2002:PAF

[1158] V. Niculescu. Parallel algorithmsfor fast Fourier transformation usingPowerList, ParList and PList theo-ries (research note). Lecture Notesin Computer Science, 2400:400–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000400.htm; http:/


series/0558/papers/2400/24000400.

pdf.

Han:2002:BBAa

[1159] J. Han, G. McMahon, and S. Sug-den. A branch and bound algo-rithm for capacitated minimum span-ning tree problem (research note). Lec-ture Notes in Computer Science, 2400:404–??, 2002. CODEN LNCSD9. ISSN



bibs/2400/24000404.htm; http:/


series/0558/papers/2400/24000404.

pdf.

Kumar:2002:AHP

[1160] V. Kumar, F.-J. Pfreundt, H. Burkhard,and J. Laghina Palma. Applicationson high performance computers. Lec-ture Notes in Computer Science, 2400:409–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000409.htm; http:/


series/0558/papers/2400/24000409.

pdf.

Plachetka:2002:PLB

[1161] T. Plachetka. Perfect load bal-ancing for demand-driven paral-lel ray tracing. Lecture Notesin Computer Science, 2400:410–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000410.htm; http:/


series/0558/papers/2400/24000410.

pdf.

Lorenz:2002:PCC

[1162] U. Lorenz. Parallel controlled con-spiracy number search. Lecture Notesin Computer Science, 2400:420–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 228


bibs/2400/24000420.htm; http:/


series/0558/papers/2400/24000420.

pdf.

Svolos:2002:PST

[1163] A. I. Svolos, C. Konstantopoulos, andC. Kaklamanis. A parallel solution intexture analysis employing a massivelyparallel processor (research note). Lec-ture Notes in Computer Science, 2400:431–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000431.htm; http:/


series/0558/papers/2400/24000431.

pdf.

Langlais:2002:SSM

[1164] M. Langlais, G. Latu, J. Roman, andP. Silan. Stochastic simulation of a ma-rine host-parasite system using a hy-brid MPI/OpenMP programming. Lec-ture Notes in Computer Science, 2400:436–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000436.htm; http:/


series/0558/papers/2400/24000436.

pdf.

Abdalhaq:2002:OFP

[1165] B. Abdalhaq, A. Cortes, T. Mar-galef, and E. Luque. Optimizationof fire propagation model inputs: Agrand challenge application on meta-computers (research note). LectureNotes in Computer Science, 2400:447–



bibs/2400/24000447.htm; http:/


series/0558/papers/2400/24000447.

pdf.

Webster:2002:PNS

[1166] S. G. Webster, M. K. Gobbert, J.-F. Remacle, and T. S. Cale. Par-allel numerical solution of the Boltz-mann equation for atomic layer de-position (research note). LectureNotes in Computer Science, 2400:452–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000452.htm; http:/


series/0558/papers/2400/24000452.

pdf.

Gaudiot:2002:PCA

[1167] J.-L. Gaudiot. Parallel computer ar-chitecture and instruction-level paral-lelism. Lecture Notes in ComputerScience, 2400:457–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2400/24000457.



2400/24000457.pdf.

Desmet:2002:IHC

[1168] V. Desmet, B. Goeman, and K. DeBosschere. Independent hashing asconfidence mechanism for value pre-dictors in microprocessors. Lecture

REFERENCES 229



bibs/2400/24000458.htm; http:/


series/0558/papers/2400/24000458.

pdf.

Sendag:2002:EPE

[1169] R. Sendag, D. J. Lilja, and S. R.Kunkel. Exploiting the prefetch-ing effect provided by executing mis-predicted load instructions. LectureNotes in Computer Science, 2400:468–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000468.htm; http:/


series/0558/papers/2400/24000468.

pdf.

Yi:2002:IIL

[1170] J. J. Yi, R. Sendag, and D. J.Lilja. Increasing instruction-level par-allelism with instruction precomputa-tion (research note). Lecture Notesin Computer Science, 2400:481–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000481.htm; http:/


series/0558/papers/2400/24000481.

pdf.

Chi:2002:RAS

[1171] C.-H. Chi and J. Yuan. Run-time association of software prefetch

control to memory access instruc-tions (research note). Lecture Notesin Computer Science, 2400:486–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000486.htm; http:/


series/0558/papers/2400/24000486.

pdf.

Uht:2002:RHI

[1172] A. Uht, A. Khalafi, D. Morano,M. de Alba, and D. Kaeli. Re-alizing high IPC using time-taggedresource-flow computing. Lecture Notesin Computer Science, 2400:490–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000490.htm; http:/


series/0558/papers/2400/24000490.

pdf.

Kailas:2002:RFA

[1173] K. Kailas, M. Franklin, and K. Ebcioglu.A register file architecture andcompilation scheme for clusteredILP processors. Lecture Notesin Computer Science, 2400:500–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000500.htm; http:/


series/0558/papers/2400/24000500.

pdf.

REFERENCES 230

Vandierendonck:2002:CSR

[1174] H. Vandierendonck, A. Ramırez, K. DeBosschere, and M. Valero. A com-parative study of redundancy in tracecaches (research note). Lecture Notesin Computer Science, 2400:512–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000512.htm; http:/


series/0558/papers/2400/24000512.

pdf.

Moure:2002:STA

[1175] J. C. Moure, D. I. Rexachs, andE. Luque. Speeding up target ad-dress generation using a self-indexedFTB (research note). Lecture Notesin Computer Science, 2400:517–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000517.htm; http:/


series/0558/papers/2400/24000517.

pdf.

Paul:2002:RPP

[1176] W. J. Paul, P. Bach, M. Bosch, J. Fis-cher, C. Lichtenau, and J. Rohrig.Real PRAM programming. LectureNotes in Computer Science, 2400:522–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000522.htm; http:/


series/0558/papers/2400/24000522.

pdf.

Trancoso:2002:MPD

[1177] P. Trancoso. In-memory parallelismfor database workloads. Lecture Notesin Computer Science, 2400:532–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000532.htm; http:/


series/0558/papers/2400/24000532.

pdf.

Sarojadevi:2002:ECC

[1178] H. Sarojadevi, S. K. Nandy, and S. Bal-akrishnan. Enforcing cache coherenceat data sharing boundaries withoutglobal control: A hardware-softwareapproach (research note). LectureNotes in Computer Science, 2400:543–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000543.htm; http:/


series/0558/papers/2400/24000543.

pdf.

Verdoscia:2002:CPD

[1179] L. Verdoscia. CODACS project: Ademand-data driven reconfigurable ar-chitecture (research note). LectureNotes in Computer Science, 2400:547–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000547.htm; http:/


series/0558/papers/2400/24000547.

pdf.

REFERENCES 231

Mavronicolas:2002:DSA

[1180] M. Mavronicolas and A. Schiper. Dis-tributed systems and algorithms. Lec-ture Notes in Computer Science, 2400:551–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000551.htm; http:/


series/0558/papers/2400/24000551.

pdf.

Datta:2002:SST

[1181] A. K. Datta, R. Hadid, and V. Vil-lain. A self-stabilizing token-based k-out-of-` exclusion algorithm. LectureNotes in Computer Science, 2400:553–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000553.htm; http:/


series/0558/papers/2400/24000553.

pdf.

Ruiz:2002:AEF

[1182] D. Ruiz, R. Corchuelo, J. A. Perez,and M. Toro. An algorithm for en-suring fairness and liveness in non-deterministic systems based on mul-tiparty interactions. Lecture Notesin Computer Science, 2400:563–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000563.htm; http:/


series/0558/papers/2400/24000563.

pdf.

Jelasity:2002:OGI

[1183] M. Jelasity and M. Preuß. Onobtaining global information in apeer-to-peer fully distributed environ-ment (research note). Lecture Notesin Computer Science, 2400:573–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000573.htm; http:/


series/0558/papers/2400/24000573.

pdf.

Baldoni:2002:FTS

[1184] R. Baldoni, C. Marchetti, andS. Tucci Piergiovanni. A fault-tolerant sequencer for timed asyn-chronous systems. Lecture Notesin Computer Science, 2400:578–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000578.htm; http:/


series/0558/papers/2400/24000578.

pdf.

Gallard:2002:DRM

[1185] P. Gallard, C. Morin, and R. Lot-tiaux. Dynamic resource manage-ment in a cluster for high-availability(research note). Lecture Notesin Computer Science, 2400:589–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000589.htm; http:/


REFERENCES 232

series/0558/papers/2400/24000589.

pdf.

Renault:2002:PIS

[1186] E. Renault and D. Millot. Progres-sive introduction of security in remote-write communications with no perfor-mance sacrifice (research note). Lec-ture Notes in Computer Science, 2400:593–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000593.htm; http:/


series/0558/papers/2400/24000593.

pdf.

Suppi:2002:PDP

[1187] R. Suppi, M. Solsona, and E. Luque.Parasite: Distributing processing us-ing Java applets (research note). Lec-ture Notes in Computer Science, 2400:598–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000598.htm; http:/


series/0558/papers/2400/24000598.

pdf.

Hammond:2002:PPM

[1188] K. Hammond. Parallel program-ming: Models, methods and pro-gramming languages. Lecture Notesin Computer Science, 2400:603–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000603.htm; http:/


series/0558/papers/2400/24000603.

pdf.

Bouge:2002:IRE

[1189] L. Bouge, V. Danjean, and R. Namyst.Improving reactivity to I/O events inmultithreaded environments using auniform, scheduler-centric API. Lec-ture Notes in Computer Science, 2400:605–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000605.htm; http:/


series/0558/papers/2400/24000605.

pdf.

Hawkins:2002:OSD

[1190] J. Hawkins and A. E. Abdallah. Anoverview of systematic developmentof parallel systems for reconfigurablehardware (research note). LectureNotes in Computer Science, 2400:615–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000615.htm; http:/


series/0558/papers/2400/24000615.

pdf.

Kuchen:2002:SL

[1191] H. Kuchen. A skeleton library. Lec-ture Notes in Computer Science, 2400:620–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000620.htm; http:/


REFERENCES 233

series/0558/papers/2400/24000620.

pdf.

Field:2002:OSR

[1192] A. J. Field, P. H. J. Kelly, and T. L.Hansen. Optimising shared reductionvariables in MPI programs. LectureNotes in Computer Science, 2400:630–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000630.htm; http:/


series/0558/papers/2400/24000630.

pdf.

Bischof:2002:DSI

[1193] H. Bischof and S. Gorlatch. Double-scan: Introducing and implementinga new data-parallel skeleton. LectureNotes in Computer Science, 2400:640–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000640.htm; http:/


series/0558/papers/2400/24000640.

pdf.

Pedicini:2002:SVC

[1194] M. Pedicini and F. Quaglia. Schedul-ing vs communication in PELCR. Lec-ture Notes in Computer Science, 2400:648–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000648.htm; http:/


series/0558/papers/2400/24000648.

pdf.

Keen:2002:EHD

[1195] A. W. Keen and R. A. Ols-son. Exception handling dur-ing asynchronous method invoca-tion (research note). Lecture Notesin Computer Science, 2400:656–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000656.htm; http:/


series/0558/papers/2400/24000656.

pdf.

Sobral:2002:DSO

[1196] J. L. Sobral and A. J. Proenca. De-signing scalable object oriented paral-lel applications (research note). Lec-ture Notes in Computer Science, 2400:661–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000661.htm; http:/


series/0558/papers/2400/24000661.

pdf.

Liniker:2002:DES

[1197] P. Liniker, O. Beckmann, and P. H. J.Kelly. Delayed evaluation, self-optimising software components as aprogramming model. Lecture Notesin Computer Science, 2400:666–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000666.htm; http:/


series/0558/papers/2400/24000666.

pdf.

REFERENCES 234

Duff:2002:NA

[1198] I. S. Duff, W. Borchers, L. Giraud,and H. A. van der Vorst. Nu-merical algorithms. Lecture Notesin Computer Science, 2400:675–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000675.htm; http:/


series/0558/papers/2400/24000675.

pdf.

Cunha:2002:NPR

[1199] R. Dias da Cunha, D. Becker, andJ. Carlton Patterson. New par-allel (rank-revealing) QR factoriza-tion algorithms. Lecture Notesin Computer Science, 2400:677–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000677.htm; http:/


series/0558/papers/2400/24000677.

pdf.

Badia:2002:SLS

[1200] J. M. Badıa, P. Benner, R. Mayo, andE. S. Quintana-Ortı. Solving largesparse Lyapunov equations on paral-lel computers (research note). LectureNotes in Computer Science, 2400:687–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000687.htm; http:/


series/0558/papers/2400/24000687.

pdf.

Takahashi:2002:BAP

[1201] D. Takahashi, T. Boku, and M. Sato.A blocking algorithm for parallel 1-D FFT on clusters of PCs. LectureNotes in Computer Science, 2400:691–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000691.htm; http:/


series/0558/papers/2400/24000691.

pdf.

Buijssen:2002:SPI

[1202] S. H. M. Buijssen and S. Turek. Sourcesof parallel inefficiency for incompress-ible CFD simulations (research note).Lecture Notes in Computer Science,2400:701–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2400/24000701.htm; http:


series/0558/papers/2400/24000701.

pdf.

Graham:2002:PIM

[1203] I. G. Graham, A. Spence, andE. Vainikko. Parallel iterative meth-ods for Navier–Stokes equations andapplication to stability assessment (dis-tinguished paper). Lecture Notesin Computer Science, 2400:705–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000705.htm; http:/


series/0558/papers/2400/24000705.

pdf.

REFERENCES 235

Boufflet:2002:MDP

[1204] J.-P. Boufflet, P. Breitkopf, A. Rassineux,and P. Villon. A modular de-sign for a parallel multifrontalmesh generator. Lecture Notesin Computer Science, 2400:715–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000715.htm; http:/


series/0558/papers/2400/24000715.

pdf.

Korch:2002:PLI

[1205] M. Korch, T. Rauber, and G. Runger.Pipelining for locality improvementin RK methods. Lecture Notesin Computer Science, 2400:724–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000724.htm; http:/


series/0558/papers/2400/24000724.

pdf.

Flammini:2002:RCI

[1206] M. Flammini, B. Maggs, J. Sibeyn, andB. Vocking. Routing and communica-tion in interconnection networks. Lec-ture Notes in Computer Science, 2400:735–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000735.htm; http:/


series/0558/papers/2400/24000735.

pdf.

Bang:2002:MMC

[1207] Y.-C. Bang and H. Choo. On mul-ticasting with minimum costs for theInternet topology. Lecture Notesin Computer Science, 2400:736–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000736.htm; http:/


series/0558/papers/2400/24000736.

pdf.

Jin:2002:SOU

[1208] H.-W. Jin, C. Yoo, and S.-K. Park.Stepwise optimizations of UDP/IP ona gigabit network (research note). Lec-ture Notes in Computer Science, 2400:745–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000745.htm; http:/


series/0558/papers/2400/24000745.

pdf.

Chen:2002:SID

[1209] Y. Chen, A. K. Datta, and S. Tixeuil.Stabilizing inter-domain routing inthe Internet (research note). LectureNotes in Computer Science, 2400:749–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000749.htm; http:/


series/0558/papers/2400/24000749.

pdf.

REFERENCES 236

Jegou:2002:PAC

[1210] Y. Jegou. Performance analysis of codecoupling on long distance high band-width network (research note). LectureNotes in Computer Science, 2400:753–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000753.htm; http:/


series/0558/papers/2400/24000753.

pdf.

Wang:2002:APB

[1211] C.-M. Wang, Y. Hou, and L.-H.Hsu. Adaptive path-based multicaston wormhole-routed hypercubes. Lec-ture Notes in Computer Science, 2400:757–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000757.htm; http:/


series/0558/papers/2400/24000757.

pdf.

Barth:2002:MDC

[1212] D. Barth, P. Berthome, T. Czar-choski, J. M. Fourneau, C. Lafor-est, and S. Vial. A mixed deflec-tion and convergence routing algo-rithm: Design and performance. Lec-ture Notes in Computer Science, 2400:767–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000767.htm; http:/


series/0558/papers/2400/24000767.

pdf.

Gomez:2002:ERA

[1213] M. E. Gomez, J. Flich, A. Robles,P. Lopez, and J. Duato. Evalua-tion of routing algorithms for Infini-Band networks (research note). Lec-ture Notes in Computer Science, 2400:775–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000775.htm; http:/


series/0558/papers/2400/24000775.

pdf.

Baydal:2002:CCB

[1214] E. Baydal, P. Lopez, and J. Du-ato. Congestion control based ontransmission times. Lecture Notesin Computer Science, 2400:781–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000781.htm; http:/


series/0558/papers/2400/24000781.

pdf.

Park:2002:DLT

[1215] Jihoon Park, Jonggyu Park, IlsukHan, and Hagbae Kim. A dual-LANtopology with the dual-path Ether-net module (research note). LectureNotes in Computer Science, 2400:791–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000791.htm; http:/


series/0558/papers/2400/24000791.

pdf.

REFERENCES 237

Fujita:2002:FBS

[1216] S. Fujita and S. Tagashira. A fast bar-rier synchronization protocol for broad-cast networks based on a dynamic ac-cess control (research note). LectureNotes in Computer Science, 2400:795–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000795.htm; http:/


series/0558/papers/2400/24000795.

pdf.

Sanders:2002:HFA

[1217] P. Sanders and J. Larsson Traff. The hi-erarchical factor algorithm for all-to-allcommunication (research note). Lec-ture Notes in Computer Science, 2400:799–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000799.htm; http:/


series/0558/papers/2400/24000799.

pdf.

Uhl:2002:AAM

[1218] A. Uhl. Architectures and algorithmsfor multimedia applications. LectureNotes in Computer Science, 2400:805–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000805.htm; http:/


series/0558/papers/2400/24000805.

pdf.

Mourlas:2002:DSC

[1219] C. Mourlas. Deterministic schedul-ing of CBR and VBR media flowson parallel media servers. LectureNotes in Computer Science, 2400:807–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000807.htm; http:/


series/0558/papers/2400/24000807.

pdf.

Cores:2002:DPT

[1220] F. Cores, A. Ripoll, and E. Luque.Double P-tree: A distributed architec-ture for large-scale video-on-demand.Lecture Notes in Computer Science,2400:816–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2400/24000816.htm; http:


series/0558/papers/2400/24000816.

pdf.

Polak:2002:MPX

[1221] S. Polak, R. Slota, and J. Kitowski.Message passing in XML-based lan-guage for creating multimedia pre-sentations (research note). LectureNotes in Computer Science, 2400:826–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000826.htm; http:/


series/0558/papers/2400/24000826.

pdf.

REFERENCES 238

Fernandez:2002:PIH

[1222] J. C. Fernandez and M. P. Malumbres.A parallel implementation of H.26Lvideo encoder (research note). LectureNotes in Computer Science, 2400:830–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000830.htm; http:/


series/0558/papers/2400/24000830.

pdf.

Paar:2002:NPS

[1223] A. Paar, M. L. Anido, and N. Bagherzadeh.A novel predication scheme for aSIMD system-on-chip. Lecture Notesin Computer Science, 2400:834–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000834.htm; http:/


series/0558/papers/2400/24000834.

pdf.

Parizi:2002:MCG

[1224] H. Parizi, A. Niktash, N. Bagherzadeh,and F. Kurdahi. MorphoSys: Acoarse grain reconfigurable archi-tecture for multimedia applications(research note). Lecture Notesin Computer Science, 2400:844–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000844.htm; http:/


series/0558/papers/2400/24000844.

pdf.

Cheresiz:2002:PSM

[1225] D. Cheresiz, B. Juurlink, S. Vas-siliadis, and H. Wijshoff. Perfor-mance scalability of multimedia in-struction set extensions. Lecture Notesin Computer Science, 2400:849–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000849.htm; http:/


series/0558/papers/2400/24000849.

pdf.

Cosnard:2002:MGC

[1226] M. Cosnard and A. Merzky. Meta-and grid-computing. Lecture Notesin Computer Science, 2400:861–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000861.htm; http:/


series/0558/papers/2400/24000861.

pdf.

Kelly:2002:IAC

[1227] P. H. J. Kelly, S. Pelagatti, andM. Rossiter. Instant-access cycle-stealing for parallel applications re-quiring interactive response. LectureNotes in Computer Science, 2400:863–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000863.htm; http:/


series/0558/papers/2400/24000863.

pdf.

REFERENCES 239

Nikolow:2002:ATE

[1228] D. Nikolow, R. S lota, M. Dziewierz,and J. Kitowski. Access time estima-tion for tertiary storage systems. Lec-ture Notes in Computer Science, 2400:873–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000873.htm; http:/


series/0558/papers/2400/24000873.

pdf.

Pytlinski:2002:BUP

[1229] J. Pytlinski, L. Skorwider, P. Ba la,M. Nazaruk, and K. Wawruch. Bi-oGRID — uniform platform forbiomoleculago nazar applications (re-search note). Lecture Notes in Com-puter Science, 2400:881–??, 2002. CO-DEN LNCSD9. ISSN 0302-9743(print), 1611-3349 (electronic). URLhttp://link.springer-ny.com/link/




2400/24000881.pdf.

Stanton:2002:ISV

[1230] J. Stanton, S. Newhouse, and J. Dar-lington. Implementing a scien-tific visualisation capability withina grid enabled component frame-work (research note). Lecture Notesin Computer Science, 2400:885–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000885.htm; http:/


series/0558/papers/2400/24000885.

pdf.

Dialani:2002:TFT

[1231] V. Dialani, S. Miles, L. Moreau,D. De Roure, and M. Luck. Trans-parent fault tolerance for Web ser-vices based architectures. LectureNotes in Computer Science, 2400:889–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000889.htm; http:/


series/0558/papers/2400/24000889.

pdf.

Alt:2002:ADP

[1232] M. Alt, H. Bischof, and S. Gor-latch. Algorithm design and per-formance prediction in a Java-basedgrid system with skeletons. LectureNotes in Computer Science, 2400:899–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000899.htm; http:/


series/0558/papers/2400/24000899.

pdf.

Caron:2002:SAN

[1233] E. Caron, F. Desprez, F. Lombard,J.-M. Nicod, L. Philippe, M. Quin-son, and F. Suter. A scalable ap-proach to network enabled servers(research note). Lecture Notesin Computer Science, 2400:907–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 240


bibs/2400/24000907.htm; http:/


series/0558/papers/2400/24000907.

pdf.

Feldmann:2002:DO

[1234] R. Feldmann and C. Roucairol. Dis-crete optimization. Lecture Notesin Computer Science, 2400:911–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000911.htm; http:/


series/0558/papers/2400/24000911.

pdf.

Gebremedhin:2002:PDC

[1235] A. H. Gebremedhin, F. Manne,and A. Pothen. Parallel distance-k coloring algorithms for numer-ical optimization. Lecture Notesin Computer Science, 2400:912–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000912.htm; http:/


series/0558/papers/2400/24000912.

pdf.

Ribeiro:2002:PGH

[1236] C. C. Ribeiro and I. Rosseti.A parallel GRASP heuristic forthe 2-path network design prob-lem (research note). Lecture Notesin Computer Science, 2400:922–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000922.htm; http:/


series/0558/papers/2400/24000922.

pdf.

Alba:2002:MLS

[1237] E. Alba, F. Almeida, M. Blesa,J. Cabeza, C. Cotta, M. Dıaz,I. Dorta, J. Gabarro, C. Leon, J. Luna,L. Moreno, C. Pablos, J. Petit, A. Ro-jas, and F. Xhafa. MALLBA: A li-brary of skeletons for combinatorialoptimisation (research note). LectureNotes in Computer Science, 2400:927–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000927.htm; http:/


series/0558/papers/2400/24000927.

pdf.

Heide:2002:MCM

[1238] F. Meyer auf der Heide, M. Kumar,S. Nikoletseas, and P. Spirakis. Mo-bile computing, mobile networks. Lec-ture Notes in Computer Science, 2400:933–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000933.htm; http:/


series/0558/papers/2400/24000933.

pdf.

Grunewald:2002:DMR

[1239] M. Grunewald, T. Lukovszki, C. Schin-delhauer, and K. Volbert. Dis-tributed maintenance of resource effi-cient wireless network topologies (dis-

REFERENCES 241

tinguished paper). Lecture Notesin Computer Science, 2400:935–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000935.htm; http:/


series/0558/papers/2400/24000935.

pdf.

Clematis:2002:LDA

[1240] A. Clematis, D. D’Agostino, andV. Gianuzzi. A local decision al-gorithm for maximum lifetime inad hoc networks. Lecture Notesin Computer Science, 2400:947–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000947.htm; http:/


series/0558/papers/2400/24000947.

pdf.

Boukerche:2002:PSD

[1241] A. Boukerche, J. Linus, and A. Saurabha.A performance study of distance sourcerouting based protocols for mobile andwireless ad hoc networks. LectureNotes in Computer Science, 2400:957–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000957.htm; http:/


series/0558/papers/2400/24000957.

pdf.

Jurdzinski:2002:WCR

[1242] T. Jurdzinski, M. Kutylowski, and

J. Zatopianski. Weak communica-tion in radio networks. Lecture Notesin Computer Science, 2400:965–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000965.htm; http:/


series/0558/papers/2400/24000965.

pdf.

Zaini:2002:CMI

[1243] N. Zaini and L. Moreau. Co-ordination of mobile intermediariesacting on behalf of mobile users(research note). Lecture Notesin Computer Science, 2400:973–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000973.htm; http:/


series/0558/papers/2400/24000973.

pdf.

Lin:2002:ETB

[1244] C.-Y. Lin, S.-C. Wang, and S.-Y.Kuo. An efficient time-based check-pointing protocol for mobile com-puting systems over wide area net-works (research note). Lecture Notesin Computer Science, 2400:978–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000978.htm; http:/


series/0558/papers/2400/24000978.

pdf.

REFERENCES 242

Hwang:2002:DCR

[1245] S.-H. Hwang and K.-J. Han. Dis-criminative collision resolution al-gorithm for wireless MAC proto-col (research note). Lecture Notesin Computer Science, 2400:983–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2400/24000983.htm; http:/


series/0558/papers/2400/24000983.

pdf.

Anonymous:2002:AIaaaah




Bae:2002:NSA

[1247] Sungil Bae, Daesik Seo, GilyoungKang, and Sungho Kang. Anew survival architecture for net-work processors. Lecture Notesin Computer Science, 2402:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020001.htm; http:/


series/0558/papers/2402/24020001.

pdf.

White:2002:MTU

[1248] Allan L. White. Mean timeto unsafe failure. Lecture Notes



bibs/2402/24020011.htm; http:/


series/0558/papers/2402/24020011.

pdf.

Kim:2002:PAA

[1249] Youngseok Kim, Seunghoon Hwang,Dongkyoon Cho, and KeumchanWhang. Performance of antenna arrayswith reverse-link synchronous trans-mission technique for DS-CDMA sys-tem in multipath fading channels. Lec-ture Notes in Computer Science, 2402:21–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020021.htm; http:/


series/0558/papers/2402/24020021.

pdf.

Kim:2002:NRA

[1250] Youngyong Kim. A noble rout-ing algorithm for the Internet com-putational GRID. Lecture Notesin Computer Science, 2402:33–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020033.htm; http:/


series/0558/papers/2402/24020033.

pdf.

Lee:2002:GRA

[1251] Sangmoon Lee, Daekeun Moon, Hag-

REFERENCES 243

bae Kim, and Whie Chang. A geneticrouting algorithm for a 2D-meshedfault-tolerant network system. LectureNotes in Computer Science, 2402:39–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020039.htm; http:/


series/0558/papers/2402/24020039.

pdf.

Na:2002:APD

[1252] Songun Na and Seungwha Yoo. Al-lowable propagation delay for VoIPcalls of acceptable quality. LectureNotes in Computer Science, 2402:47–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020047.htm; http:/


series/0558/papers/2402/24020047.

pdf.

Lee:2002:RNS

[1253] Dongho Lee, Jungsup Kim, SoodukKim, Kichang Kim, and JaehyunPark. Robustness of a neighborselection Markov chain in prefetch-ing tiled Web data. Lecture Notesin Computer Science, 2402:57–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020057.htm; http:/


series/0558/papers/2402/24020057.

pdf.

Shankar:2002:QSP

[1254] Sai Shankar and Sunghyun Choi. QoSsignaling for parameterized traffic inIEEE 802.11e wireless LANs. LectureNotes in Computer Science, 2402:67–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020067.htm; http:/


series/0558/papers/2402/24020067.

pdf.

Kim:2002:CAR

[1255] Hagyoung Kim, Sungin Jung, andCheolhoon Lee. Content-adaptive re-quest distribution strategy for Inter-net server cluster. Lecture Notesin Computer Science, 2402:85–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020085.htm; http:/


series/0558/papers/2402/24020085.

pdf.

Yoon:2002:NDA

[1256] Sungchul Yoon, Sangwook Kim, Jae-seuk Oh, and Sungho Kang. A newDSP architecture for correcting er-rors using Viterbi algorithm. LectureNotes in Computer Science, 2402:95–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020095.htm; http:/


series/0558/papers/2402/24020095.

pdf.

REFERENCES 244

Kang:2002:AWR

[1257] Moonsik Kang, Junho Lee, and Sang-min Lee. An adapting weight rerout-ing algorithm for handoff control inwireless ATM networks. Lecture Notesin Computer Science, 2402:103–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020103.htm; http:/


series/0558/papers/2402/24020103.

pdf.

Hong:2002:OBS

[1258] Taechul Hong and Youngyong Kim.Optimal buffering strategy for stream-ing service in time varying wire-less environment. Lecture Notesin Computer Science, 2402:115–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020115.htm; http:/


series/0558/papers/2402/24020115.

pdf.

Lee:2002:OSR

[1259] Heeyong Lee, Gilyoung Kong, SihwaKim, Cholseong Kim, and Jaechul Lee.Optimum ship routing and it’s im-plementation on the Web. LectureNotes in Computer Science, 2402:125–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020125.htm; http:/


series/0558/papers/2402/24020125.

pdf.

Park:2002:DRG

[1260] Jongkyu Park, Ilseok Han, JinhyuckKwon, Jun Hwang, Hagbae Kim, Sang-tae Ahn, and Whie Chang. Develop-ment of a residential gateway and a ser-vice server for home automation. Lec-ture Notes in Computer Science, 2402:137–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020137.htm; http:/


series/0558/papers/2402/24020137.

pdf.

Pak:2002:PMT

[1261] Uiyoung Pak, Joonseok Maeng, IksooJin, and Keumchan Whang. Perfor-mance of multiple TCM codes withtransmit antenna diversity. LectureNotes in Computer Science, 2402:151–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020151.htm; http:/


series/0558/papers/2402/24020151.

pdf.

Kim:2002:SML

[1262] Sangyoub Kim. On the study ofMAC layer for cdma2000 wirelesspacket data service. Lecture Notesin Computer Science, 2402:161–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 245

bibs/2402/24020161.htm; http:/


series/0558/papers/2402/24020161.

pdf.

Jeon:2002:ITO

[1263] Taewoong Jeon, Sungyoung Lee, andHyonwoo Seung. Increasing the testa-bility of object-oriented frameworkswith built-in tests. Lecture Notesin Computer Science, 2402:169–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020169.htm; http:/


series/0558/papers/2402/24020169.

pdf.

Jung:2002:GCS

[1264] Sungin Jung, Hagyoung Kim, andCheolhoon Lee. Guaranteeing thecontinuous stream service in clus-ter media servers. Lecture Notesin Computer Science, 2402:183–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020183.htm; http:/


series/0558/papers/2402/24020183.

pdf.

Lee:2002:SBF

[1265] Changho Lee, Jaehyun Park, andYoosung Kim. A SOAP-based frame-work for the Internetworked dis-tributed control systems. LectureNotes in Computer Science, 2402:195–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2402/24020195.htm; http:/


series/0558/papers/2402/24020195.

pdf.

Bae:2002:ELM

[1266] Sangmin Bae, Dongsup Song, JihyeKim, and Sungho Kang. An effi-cient on-line monitoring BIST for re-mote service system. Lecture Notesin Computer Science, 2402:205–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020205.htm; http:/


series/0558/papers/2402/24020205.

pdf.

Roh:2002:TPE

[1267] Inho Roh and Youngyong Kim. TCPperformance enhancement using FG-LIW (fairness guaranteed — larger ini-tial window) scheme in the wired-cum-wireless network environment. LectureNotes in Computer Science, 2402:215–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020215.htm; http:/


series/0558/papers/2402/24020215.

pdf.

Yun:2002:CSP

[1268] Yongchul Yun, Jinwoo Choe, and Won-jin Sung. A comparative study on theperformance of detectors and interfer-ence models for OCDMA LANs. Lec-

REFERENCES 246



bibs/2402/24020223.htm; http:/


series/0558/papers/2402/24020223.

pdf.

Baek:2002:TMO

[1269] Yuncheol Baek. A tool measur-ing operating system supports forsquid proxy cache. Lecture Notesin Computer Science, 2402:239–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020239.htm; http:/


series/0558/papers/2402/24020239.

pdf.

Jeon:2002:DIO

[1270] Taewoong Jeon, Sunghwan Roh, Hy-onwoo Seung, and Sungyoung Lee.The design and implementation ofan object-oriented process controlloop framework. Lecture Notesin Computer Science, 2402:249–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020249.htm; http:/


series/0558/papers/2402/24020249.

pdf.

Lee:2002:PIL

[1271] Sangmoon Lee, Sinjun Kang, ByungseokMin, and Hagbae Kim. A personal In-

ternet live-broadcasting system. Lec-ture Notes in Computer Science, 2402:263–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020263.htm; http:/


series/0558/papers/2402/24020263.

pdf.

Kong:2002:DIS

[1272] Gilyoung Kong, Chungro Lee, SoonkapKim, Gilsoo Kim, and Cholseong Kim.On the development of an informa-tion service system for navigationalsafety of seagoing vessels. LectureNotes in Computer Science, 2402:273–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020273.htm; http:/


series/0558/papers/2402/24020273.

pdf.

Kim:2002:OCW

[1273] Taewon Kim, Wonjin Sung, and JinwooChoe. Optimal code weight selectionfor 2-D optical CDMA systems. Lec-ture Notes in Computer Science, 2402:285–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020285.htm; http:/


series/0558/papers/2402/24020285.

pdf.

Lee:2002:RCI

[1274] Sangyeob Lee and Whoiyul Kim. Ro-

REFERENCES 247

bust character image retrieval methodusing bipartite matching and pseudo-bipartite matching. Lecture Notesin Computer Science, 2402:295–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2402/24020295.htm; http:/


series/0558/papers/2402/24020295.

pdf.

Anonymous:2002:AIaaaai




Decker:2002:CIA

[1276] Keith Decker. Coordinating in-telligent agents. Lecture Notesin Computer Science, 2403:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030001.htm; http:/


series/0558/papers/2403/24030001.

pdf.

Durfee:2002:SDC

[1277] Edmund H. Durfee. Strategies for dis-covering coordination needs in Mul-tiAgent systems. Lecture Notesin Computer Science, 2403:19–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030019.htm; http:/


series/0558/papers/2403/24030019.

pdf.

Sierra:2002:AMI

[1278] Carles Sierra and Pablo Noriega.Agent-mediated interaction. from auc-tions to negotiation and argumen-tation. Lecture Notes in ComputerScience, 2403:27–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2403/24030027.



2403/24030027.pdf.

Tennenholtz:2002:GTA

[1279] Moshe Tennenholtz. Game theoryand artificial intelligence. LectureNotes in Computer Science, 2403:49–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030049.htm; http:/


series/0558/papers/2403/24030049.

pdf.

Alonso:2002:RMA

[1280] Eduardo Alonso. Rights for multi-agent systems. Lecture Notesin Computer Science, 2403:59–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030059.htm; http:/


REFERENCES 248

series/0558/papers/2403/24030059.

pdf.

Ashri:2002:ISA

[1281] Ronald Ashri, Michael Luck, and Markd’Inverno. Infrastructure support foragent-based development. LectureNotes in Computer Science, 2403:73–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030073.htm; http:/


series/0558/papers/2403/24030073.

pdf.

Bordini:2002:AAD

[1282] Rafael H. Bordini, Renata Vieira, andJohn A. Campbell. An anthropolog-ical approach to the discovery of on-tologies in multi-agent societies. Lec-ture Notes in Computer Science, 2403:89–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030089.htm; http:/


series/0558/papers/2403/24030089.

pdf.

Buckle:2002:SMA

[1283] Phil Buckle, Tom Moore, SteveRobertshaw, Alan Treadway, SasuTarkoma, and Stefan Poslad. Scal-ability in multi-agent systems: TheFIPA-OS perspective. Lecture Notesin Computer Science, 2403:110–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030110.htm; http:/


series/0558/papers/2403/24030110.

pdf.

Doran:2002:AMS

[1284] Jim Doran. Agents and MAS in STaMs.Lecture Notes in Computer Science,2403:131–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2403/24030131.htm; http:


series/0558/papers/2403/24030131.

pdf.

Eijk:2002:SAC

[1285] Rogier M. van Eijk. Semantics of agentcommunication: An introduction. Lec-ture Notes in Computer Science, 2403:152–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030152.htm; http:/


series/0558/papers/2403/24030152.

pdf.

Fisher:2002:ABT

[1286] Michael Fisher and Chiara Ghi-dini. Agents with bounded tem-poral resources. Lecture Notesin Computer Science, 2403:169–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030169.htm; http:/


series/0558/papers/2403/24030169.

pdf.

REFERENCES 249

Norman:2002:MDM

[1287] Timothy J. Norman and ChrisReed. A model of delegation formulti-agent systems. Lecture Notesin Computer Science, 2403:185–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030185.htm; http:/


series/0558/papers/2403/24030185.

pdf.

Parsons:2002:ASU

[1288] Simon Parsons, Nicholas R. Jen-nings, Jordi Sabater, and CarlesSierra. Agent specification usingmulti-context systems. Lecture Notesin Computer Science, 2403:205–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030205.htm; http:/


series/0558/papers/2403/24030205.

pdf.

Preist:2002:ACM

[1289] Chris Preist and Siani Pearson. Anadaptive choice of messaging proto-col in multi agent systems. LectureNotes in Computer Science, 2403:227–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030227.htm; http:/


series/0558/papers/2403/24030227.

pdf.

Schut:2002:POM

[1290] Martijn Schut, Michael Wooldridge,and Simon Parsons. On partially ob-servable MDPs and BDI models. Lec-ture Notes in Computer Science, 2403:243–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2403/24030243.htm; http:/


series/0558/papers/2403/24030243.

pdf.

Anonymous:2002:AIaaaaj




Hull:2002:IYW

[1292] Richard Hull, Bharat Kumar, Ar-naud Sahuguet, and Ming Xiong.Have it your way: Personalizationof network-hosted services. LectureNotes in Computer Science, 2405:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050001.htm; http:/


series/0558/papers/2405/24050001.

pdf.

Gounaris:2002:AQP

[1293] Anastasios Gounaris, Norman W. Pa-ton, Alvaro A. A. Fernandes, and Ri-zos Sakellariou. Adaptive query pro-cessing: A survey. Lecture Notes

REFERENCES 250



bibs/2405/24050011.htm; http:/


series/0558/papers/2405/24050011.

pdf.

Giannella:2002:IQE

[1294] Chris M. Giannella, Mehmet M. Dalk-ilic, Dennis P. Groth, and Edward L.Robertson. Improving query evalua-tion with approximate functional de-pendency based decompositions. Lec-ture Notes in Computer Science, 2405:26–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050026.htm; http:/


series/0558/papers/2405/24050026.

pdf.

Boyd:2002:ASI

[1295] Michael Boyd, Peter McBrien, andNerissa Tong. The AutoMed schemaintegration repository. Lecture Notesin Computer Science, 2405:42–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050042.htm; http:/


series/0558/papers/2405/24050042.

pdf.

Jasper:2002:GQP

[1296] Edgar Jasper. Global query pro-cessing in the AutoMed heteroge-

neous database environment. LectureNotes in Computer Science, 2405:46–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050046.htm; http:/


series/0558/papers/2405/24050046.

pdf.

Fan:2002:TDL

[1297] Hao Fan. Tracing data lineageusing automed schema transforma-tion pathways. Lecture Notesin Computer Science, 2405:50–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050050.htm; http:/


series/0558/papers/2405/24050050.

pdf.

Gupta:2002:SMA

[1298] Amarnath Gupta, Bertram Ludascher,Maryann E. Martone, Xufei Qian,Edward Ross, Joshua Tran, andIlya Zaslavsky. A system for man-aging alternate models in model-based mediation. Lecture Notesin Computer Science, 2405:54–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050054.htm; http:/


series/0558/papers/2405/24050054.

pdf.

REFERENCES 251

Ram:2002:CMB

[1299] Sudha Ram, Jinsoo Park, andYousub Hwang. CREAM: A me-diator based environment for mod-eling and accessing distributed in-formation on the Web. LectureNotes in Computer Science, 2405:58–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050058.htm; http:/


series/0558/papers/2405/24050058.

pdf.

Shou:2002:IAH

[1300] Xiao Mang Shou and Siobhan North.An integrated approach to han-dling collaborative diagram databaseson the WWW. Lecture Notesin Computer Science, 2405:62–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050062.htm; http:/


series/0558/papers/2405/24050062.

pdf.

Medina:2002:HCM

[1301] Enrique Medina, Sergio Lujan-Mora,and Juan Trujillo. Handling con-ceptual multidimensional models us-ing XML through DTDs. LectureNotes in Computer Science, 2405:66–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050066.htm; http:/


series/0558/papers/2405/24050066.

pdf.

Lepinioti:2002:IDM

[1302] Konstantina Lepinioti and StephenMcKearney. Implementing data min-ing in a DBMS. Lecture Notesin Computer Science, 2405:70–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050070.htm; http:/


series/0558/papers/2405/24050070.

pdf.

Lodi:2002:FDC

[1303] Stefano Lodi. Fully dynamic clus-tering of metric data sets. LectureNotes in Computer Science, 2405:73–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050073.htm; http:/


series/0558/papers/2405/24050073.

pdf.

Veloso:2002:RWA

[1304] Adriano Veloso, Bruno Rocha, Marciode Carvalho, and Wagner Meira Jr.Real world association rule mining.Lecture Notes in Computer Science,2405:77–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2405/24050077.htm; http:


series/0558/papers/2405/24050077.

pdf.

REFERENCES 252

Engstrom:2002:ICE

[1305] Henrik Engstrom, Sharma Chakravarthy,and Brian Lings. Implementationand comparative evaluation of main-tenance policies in a data ware-house environment. Lecture Notesin Computer Science, 2405:90–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050090.htm; http:/


series/0558/papers/2405/24050090.

pdf.

Burgess:2002:ETQ

[1306] Mikhaila Burgess, W. Alex Gray,and Nick Fiddian. Establishing ataxonomy of quality for use in in-formation filtering. Lecture Notesin Computer Science, 2405:103–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050103.htm; http:/


series/0558/papers/2405/24050103.

pdf.

Couchot:2002:IRT

[1307] Alain Couchot. Improving the re-fined triggering graph method for ac-tive rules termination analysis. Lec-ture Notes in Computer Science, 2405:114–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050114.htm; http:/


series/0558/papers/2405/24050114.

pdf.

Fu:2002:ADR

[1308] Gaihua Fu, Jianhua Shao, Suzanne M.Embury, and W. Alex Gray. An al-gorithm for determining related con-straints. Lecture Notes in ComputerScience, 2405:134–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2405/24050134.



2405/24050134.pdf.

Zwol:2002:RPE

[1309] Roelof van Zwol and Peter M. G.Apers. Retrieval performance experi-ment with the Webspace method. Lec-ture Notes in Computer Science, 2405:150–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050150.htm; http:/


series/0558/papers/2405/24050150.

pdf.

Theodoratos:2002:SIQ

[1310] Dimitri Theodoratos. Semantic in-tegration and querying of heteroge-neous data sources using a hyper-graph data model. Lecture Notesin Computer Science, 2405:166–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050166.htm; http:/


REFERENCES 253

series/0558/papers/2405/24050166.

pdf.

Brisaboa:2002:DDQ

[1311] Nieves R. Brisaboa, Miguel R. Pen-abad, Angeles S. Places, and Fran-cisco J. Rodrıguez. A documentdatabase query language. LectureNotes in Computer Science, 2405:183–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2405/24050183.htm; http:/


series/0558/papers/2405/24050183.

pdf.

Anonymous:2002:AIaaaak



papers/2405/24050199.pdf.

Peters:2002:I

[1313] Carol Peters. Introduction. LectureNotes in Computer Science, 2406:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060001.htm; http:/


series/0558/papers/2406/24060001.

pdf.

Braschler:2002:COR

[1314] Martin Braschler. CLEF 2001 —overview of results. Lecture Notesin Computer Science, 2406:9–??,



bibs/2406/24060009.htm; http:/


series/0558/papers/2406/24060009.

pdf.

Savoy:2002:RCE

[1315] Jacques Savoy. Report on CLEF-2001 experiments: Effective combinedquery-translation approach. LectureNotes in Computer Science, 2406:27–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060027.htm; http:/


series/0558/papers/2406/24060027.

pdf.

Chen:2002:MIR

[1316] Aitao Chen. Multilingual infor-mation retrieval using English andChinese queries. Lecture Notesin Computer Science, 2406:44–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060044.htm; http:/


series/0558/papers/2406/24060044.

pdf.

Jones:2002:ECE

[1317] Gareth J. F. Jones and Adenike M.Lam-Adesina. Exeter at CLEF 2001:Experiments with machine transla-tion for bilingual retrieval. LectureNotes in Computer Science, 2406:59–

REFERENCES 254



bibs/2406/24060059.htm; http:/


series/0558/papers/2406/24060059.

pdf.

Kraaij:2002:TCC

[1318] Wessel Kraaij. TNO at CLEF-2001:Comparing translation resources. Lec-ture Notes in Computer Science, 2406:78–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060078.htm; http:/


series/0558/papers/2406/24060078.

pdf.

Bertoldi:2002:IIC

[1319] Nicola Bertoldi and Marcello Federico.ITC-irst at CLEF 2001: Monolin-gual and bilingual tracks. LectureNotes in Computer Science, 2406:94–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060094.htm; http:/


series/0558/papers/2406/24060094.

pdf.

Braschler:2002:EER

[1320] Martin Braschler, Barbel Ripplinger,and Peter Schauble. Experimentswith the eurospider retrieval sys-tem for CLEF 2001. Lecture Notesin Computer Science, 2406:102–??,2002. CODEN LNCSD9. ISSN



bibs/2406/24060102.htm; http:/


series/0558/papers/2406/24060102.

pdf.

Lin:2002:UCO

[1321] Wen-Cheng Lin and Hsin-Hsi Chen.Using co-occurrence, augmented re-strictions, and C-E WordNet forChinese–English cross-language infor-mation retrieval at CLEF 2001. Lec-ture Notes in Computer Science, 2406:111–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060111.htm; http:/


series/0558/papers/2406/24060111.

pdf.

Hedlund:2002:UCE

[1322] Turid Hedlund, Heikki Keskustalo,Ari Pirkola, Eija Airio, and KalervoJarvelin. Utaclir @ CLEF 2001 —effects of compound splitting andN-gram techniques. Lecture Notesin Computer Science, 2406:118–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060118.htm; http:/


series/0558/papers/2406/24060118.

pdf.

Nie:2002:UST

[1323] Jian-Yun Nie and Michel Simard.Using statistical translation models

REFERENCES 255

for bilingual IR. Lecture Notesin Computer Science, 2406:137–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060137.htm; http:/


series/0558/papers/2406/24060137.

pdf.

Rogati:2002:CLP

[1324] Monica Rogati and Yiming Yang.Cross-lingual pseudo-relevance feed-back using a comparable corpus. Lec-ture Notes in Computer Science, 2406:151–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060151.htm; http:/


series/0558/papers/2406/24060151.

pdf.

Boughanem:2002:IDC

[1325] M. Boughanem, C. Chrisment, andN. Nassr. Investigation on dis-ambiguation in CLIR: Aligned cor-pus and bi-directional translation-based strategies. Lecture Notesin Computer Science, 2406:158–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060158.htm; http:/


series/0558/papers/2406/24060158.

pdf.

Sahlgren:2002:VBS

[1326] Magnus Sahlgren and Jussi Karl-

gren. Vector-based semantic analy-sis using random indexing for cross-lingual query expansion. LectureNotes in Computer Science, 2406:169–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060169.htm; http:/


series/0558/papers/2406/24060169.

pdf.

Sadat:2002:QET

[1327] Fatiha Sadat, Akira Maeda, MasatoshiYoshikawa, and Shunsuke Uemura.Query expansion techniques for theCLEF bilingual track. Lecture Notesin Computer Science, 2406:177–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060177.htm; http:/


series/0558/papers/2406/24060177.

pdf.

Martinez-Santiago:2002:IIA

[1328] Fernando Martınez-Santiago, L. Al-fonso Urena-Lopez, M. Carlos Dıaz-Galiano, Maite Martın-Valdivia, andManuel Garcıa-Vega. Intelligent in-formation access systems (SINAI) atCLEF 2001: Calculating translationprobabilities with SemCor. LectureNotes in Computer Science, 2406:185–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060185.htm; http:/


REFERENCES 256

series/0558/papers/2406/24060185.

pdf.

McNamee:2002:JAE

[1329] Paul McNamee and James May-field. JHU/APL experiments atCLEF: Translation resources andscore normalization. Lecture Notesin Computer Science, 2406:193–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060193.htm; http:/


series/0558/papers/2406/24060193.

pdf.

Chuleerat:2002:DBT

[1330] Jaruskulchai Chuleerat. Dictionary-based Thai CLIR: An experimen-tal survey of Thai CLIR. LectureNotes in Computer Science, 2406:209–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060209.htm; http:/


series/0558/papers/2406/24060209.

pdf.

Adriani:2002:EDC

[1331] Mirna Adriani. English-dutch CLIR us-ing query translation techniques. Lec-ture Notes in Computer Science, 2406:219–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060219.htm; http:/


series/0558/papers/2406/24060219.

pdf.

Molina-Salgado:2002:TLR

[1332] Hugo Molina-Salgado, Isabelle Moulin-ier, Mark Knudson, Elizabeth Lund,and Kirat Sekhon. Thomson legal andregulatory at CLEF 2001: Monolin-gual and bilingual experiments. Lec-ture Notes in Computer Science, 2406:226–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060226.htm; http:/


series/0558/papers/2406/24060226.

pdf.

Gey:2002:WRQ

[1333] Fredric C. Gey, Hailing Jiang, and Na-talia Perelman. Working with Rus-sian queries for the GIRT, bilingual,and multilingual CLEF tasks. LectureNotes in Computer Science, 2406:235–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060235.htm; http:/


series/0558/papers/2406/24060235.

pdf.

Llopis:2002:IPR

[1334] Fernando Llopis and Jose L. Vicedo.IR-n: A passage retrieval sys-tem at CLEF-2001. Lecture Notesin Computer Science, 2406:244–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 257

bibs/2406/24060244.htm; http:/


series/0558/papers/2406/24060244.

pdf.

Figuerola:2002:SMT

[1335] Carlos G. Figuerola, Raquel Gomez,Angel F. Zazo Rodrıguez, and JoseLuis Alonso Berrocal. Spanish mono-lingual track: The impact of stem-ming on retrieval. Lecture Notesin Computer Science, 2406:253–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060253.htm; http:/


series/0558/papers/2406/24060253.

pdf.

Monz:2002:SMA

[1336] Christof Monz and Maarten de Ri-jke. Shallow morphological analysis inmonolingual information retrieval fordutch, german, and italian. LectureNotes in Computer Science, 2406:262–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060262.htm; http:/


series/0558/papers/2406/24060262.

pdf.

Tomlinson:2002:SEL

[1337] Stephen Tomlinson. Stemming evalu-ated in 6 languages by hummingbirdSearchServerTM at CLEF 2001. Lec-ture Notes in Computer Science, 2406:278–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2406/24060278.htm; http:/


series/0558/papers/2406/24060278.

pdf.

Frizzarin:2002:MTR

[1338] Teresita Frizzarin and Annius Groenink.Minimalistic test runs of the ei-detica indexer. Lecture Notesin Computer Science, 2406:288–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060288.htm; http:/


series/0558/papers/2406/24060288.

pdf.

Matoyo:2002:ABC

[1339] Eugenia Matoyo and Tony Valsamidis.Across the bridge: CLEF 2001 —non-English monolingual retrieval.the French task. Lecture Notesin Computer Science, 2406:291–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060291.htm; http:/


series/0558/papers/2406/24060291.

pdf.

Ripplinger:2002:MIC

[1340] Barbel Ripplinger. Mpro-IR in CLEF2001. Lecture Notes in Computer Sci-ence, 2406:300–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


REFERENCES 258

series/0558/bibs/2406/24060300.



2406/24060300.pdf.

Klok:2002:STM

[1341] Jakob Klok, Samuel Driessen, and Mar-vin Brunner. Some terms are moreinterchangeable than others. LectureNotes in Computer Science, 2406:303–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060303.htm; http:/


series/0558/papers/2406/24060303.

pdf.

Oard:2002:CIT

[1342] Douglas W. Oard and Julio Gonzalo.The CLEF 2001 interactive track. Lec-ture Notes in Computer Science, 2406:308–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060308.htm; http:/


series/0558/papers/2406/24060308.

pdf.

Lopez-Ostenero:2002:NPT

[1343] Fernando Lopez-Ostenero, Julio Gon-zalo, Anselmo Penas, and FelisaVerdejo. Noun phrase translationsfor cross-language document selection.Lecture Notes in Computer Science,2406:320–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2406/24060320.htm; http:


series/0558/papers/2406/24060320.

pdf.

Sanderson:2002:IS

[1344] Mark Sanderson and Zoe Bathie.iCLEF at sheffield. Lecture Notesin Computer Science, 2406:332–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060332.htm; http:/


series/0558/papers/2406/24060332.

pdf.

Wang:2002:IMC

[1345] Jianqiang Wang and Douglas W. Oard.iCLEF 2001 at maryland: Comparingterm-for-term gloss and MT. LectureNotes in Computer Science, 2406:336–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060336.htm; http:/


series/0558/papers/2406/24060336.

pdf.

Voorhees:2002:PIR

[1346] Ellen M. Voorhees. The philosophy ofinformation retrieval evaluation. Lec-ture Notes in Computer Science, 2406:355–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060355.htm; http:/


series/0558/papers/2406/24060355.

pdf.

REFERENCES 259

Kando:2002:CSE

[1347] Noriko Kando. CLIR system evaluationat the second NTCIR workshop. Lec-ture Notes in Computer Science, 2406:371–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060371.htm; http:/


series/0558/papers/2406/24060371.

pdf.

Womser-Hacker:2002:MTG

[1348] Christa Womser-Hacker. Multilin-gual topic generation within the CLEF2001 experiments. Lecture Notesin Computer Science, 2406:389–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060389.htm; http:/


series/0558/papers/2406/24060389.

pdf.

Braschler:2002:CMM

[1349] Martin Braschler and Carol Peters.CLEF methodology and metrics. Lec-ture Notes in Computer Science, 2406:394–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2406/24060394.htm; http:/


series/0558/papers/2406/24060394.

pdf.

Anonymous:2002:AIaaaal

[1350] Anonymous. Author index. LectureNotes in Computer Science, 2406:601–




Bruynooghe:2002:PSC

[1351] Maurice Bruynooghe, Luıs MonizPereira, Jorg H. Siekmann, andMaarten van Emden. A por-trait of a scientist as a compu-tational logician. Lecture Notesin Computer Science, 2407:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070001.htm; http:/


series/0558/papers/2407/24070001.

pdf.

Sergot:2002:BKP

[1352] Marek Sergot. Bob Kowalski: A por-trait. Lecture Notes in ComputerScience, 2407:5–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2407/24070005.



2407/24070005.pdf.

Kowalski:2002:DLP

[1353] Robert A. Kowalski. Directions forlogic programming. Lecture Notesin Computer Science, 2407:26–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070026.htm; http:/

REFERENCES 260


series/0558/papers/2407/24070026.

pdf.

Clark:2002:AMT

[1354] Keith Clark and Peter J. Robin-son. Agents as multi-threadedlogical objects. Lecture Notesin Computer Science, 2407:33–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070033.htm; http:/


series/0558/papers/2407/24070033.

pdf.

Davison:2002:LPL

[1355] Andrew Davison. Logic programminglanguages for the Internet. LectureNotes in Computer Science, 2407:66–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070066.htm; http:/


series/0558/papers/2407/24070066.

pdf.

Lloyd:2002:HOC

[1356] John W. Lloyd. Higher-order com-putational logic. Lecture Notesin Computer Science, 2407:105–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070105.htm; http:/


series/0558/papers/2407/24070105.

pdf.

Ueda:2002:PMI

[1357] Kazunori Ueda. A pure meta-interpreter for flat GHC, a concur-rent constraint language. LectureNotes in Computer Science, 2407:138–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070138.htm; http:/


series/0558/papers/2407/24070138.

pdf.

Bossi:2002:TSN

[1358] Annalisa Bossi, Nicoletta Cocco, andSandro Etalle. Transformation systemsand nondeclarative properties. LectureNotes in Computer Science, 2407:162–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070162.htm; http:/


series/0558/papers/2407/24070162.

pdf.

Schreye:2002:AGO

[1359] Danny De Schreye and Alexan-der Serebrenik. Acceptability withgeneral orderings. Lecture Notesin Computer Science, 2407:187–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070187.htm; http:/


series/0558/papers/2407/24070187.

pdf.

REFERENCES 261

Gupta:2002:SIV

[1360] Gopal Gupta and Enrico Pon-telli. Specification, implementation,and verification of domain specificlanguages: A logic programming-based approach. Lecture Notesin Computer Science, 2407:211–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070211.htm; http:/


series/0558/papers/2407/24070211.

pdf.

Mancarella:2002:NFT

[1361] Paolo Mancarella, Dino Pedreschi,and Salvatore Ruggieri. Negationas failure through abduction: Rea-soning about termination. LectureNotes in Computer Science, 2407:240–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070240.htm; http:/


series/0558/papers/2407/24070240.

pdf.

Pettorossi:2002:PDR

[1362] Alberto Pettorossi and MaurizioProietti. Program derivation =rules + strategies. Lecture Notesin Computer Science, 2407:273–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070273.htm; http:/


series/0558/papers/2407/24070273.

pdf.

Flener:2002:APP

[1363] Pierre Flener. Achievements andprospects of program synthesis. Lec-ture Notes in Computer Science, 2407:310–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070310.htm; http:/


series/0558/papers/2407/24070310.

pdf.

Lau:2002:LCB

[1364] Kung-Kiu Lau and Mario Ornaghi.Logic for component-based soft-ware development. Lecture Notesin Computer Science, 2407:347–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070347.htm; http:/


series/0558/papers/2407/24070347.

pdf.

Sterling:2002:PPP

[1365] Leon Sterling. Patterns for Pro-log programming. Lecture Notesin Computer Science, 2407:374–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070374.htm; http:/


series/0558/papers/2407/24070374.

pdf.

REFERENCES 262

Denecker:2002:ALP

[1366] Marc Denecker and Antonis Kakas. Ab-duction in logic programming. LectureNotes in Computer Science, 2407:402–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070402.htm; http:/


series/0558/papers/2407/24070402.

pdf.

Flach:2002:LCL

[1367] Peter Flach and Nada Lavrac. Learn-ing in clausal logic: A perspective oninductive logic programming. LectureNotes in Computer Science, 2407:437–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070437.htm; http:/


series/0558/papers/2407/24070437.

pdf.

Minker:2002:DLP

[1368] Jack Minker and Dietmar Seipel. Dis-junctive logic programming: A sur-vey and assessment. Lecture Notesin Computer Science, 2407:472–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070472.htm; http:/


series/0558/papers/2407/24070472.

pdf.

Wallace:2002:CLP

[1369] Mark Wallace. Constraint logic pro-gramming. Lecture Notes in ComputerScience, 2407:512–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2407/24070512.



2407/24070512.pdf.

Aiello:2002:PAS

[1370] Luigia Carlucci Aiello and FabioMassacci. Planning attacks to se-curity protocols: Case studies inlogic programming. Lecture Notesin Computer Science, 2407:533–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070533.htm; http:/


series/0558/papers/2407/24070533.

pdf.

Buccafurri:2002:MCJ

[1371] Francesco Buccafurri and Georg Got-tlob. Multiagent compromises, jointfixpoints, and stable models. LectureNotes in Computer Science, 2407:561–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070561.htm; http:/


series/0558/papers/2407/24070561.

pdf.

REFERENCES 263

Eiter:2002:ETA

[1372] Thomas Eiter, Viviana Mascardi,and V. S. Subrahmanian. Error-tolerant agents. Lecture Notesin Computer Science, 2407:586–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070586.htm; http:/


series/0558/papers/2407/24070586.

pdf.

Jung:2002:LBH

[1373] Christoph G. Jung and Klaus Fischer.Logic-based hybrid agents. LectureNotes in Computer Science, 2407:626–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070626.htm; http:/


series/0558/papers/2407/24070626.

pdf.

Sjoland:2002:HSR

[1374] Thomas Sjoland, Per Kreuger, andMartin Aronsson. Heterogeneousscheduling and rotation. LectureNotes in Computer Science, 2407:655–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2407/24070655.htm; http:/


series/0558/papers/2407/24070655.

pdf.

Anonymous:2002:AIaaaam




Baldan:2002:MLT

[1376] Paolo Baldan, Paolo Mancarella,Alessandra Raffaeta, and FrancoTurini. MuTACLP: A language fortemporal reasoning with multiple the-ories. Lecture Notes in ComputerScience, 2408:1–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2408/24080001.



2408/24080001.pdf.

Calvanese:2002:DLI

[1377] Diego Calvanese, Giuseppe De Gia-como, and Maurizio Lenzerini. Descrip-tion logics for information integration.Lecture Notes in Computer Science,2408:41–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2408/24080041.htm; http:


series/0558/papers/2408/24080041.

pdf.

Greco:2002:SOP

[1378] Sergio Greco and Domenico Sacca.Search and optimization problems indatalog. Lecture Notes in Computer

REFERENCES 264

Science, 2408:61–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2408/24080061.



2408/24080061.pdf.

Mascellani:2002:DSM

[1379] Paolo Mascellani and Dino Pedreschi.The declarative side of magic. LectureNotes in Computer Science, 2408:83–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080083.htm; http:/


series/0558/papers/2408/24080083.

pdf.

Zaniolo:2002:KCM

[1380] Carlo Zaniolo. Key constraintsand monotonic aggregates in de-ductive databases. Lecture Notesin Computer Science, 2408:109–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080109.htm; http:/


series/0558/papers/2408/24080109.

pdf.

Broda:2002:DCS

[1381] Krysia Broda. A decidable CLDS forsome propositional resource logics. Lec-ture Notes in Computer Science, 2408:135–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080135.htm; http:/


series/0558/papers/2408/24080135.

pdf.

Bundy:2002:CPP

[1382] Alan Bundy. A critique of proof plan-ning. Lecture Notes in Computer Sci-ence, 2408:160–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2408/24080160.



2408/24080160.pdf.

Hasegawa:2002:MGB

[1383] Ryuzo Hasegawa, Hiroshi Fujita,Miyuki Koshimura, and Yasuyuki Shi-rai. A model generation based theoremprover MGTP for first-order logic. Lec-ture Notes in Computer Science, 2408:178–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080178.htm; http:/


series/0558/papers/2408/24080178.

pdf.

Omodeo:2002:TMP

[1384] Eugenio G. Omodeo and Jacob T.Schwartz. A ‘theory’ mechanismfor a proof-verifier based on first-order set theory. Lecture Notesin Computer Science, 2408:214–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 265

bibs/2408/24080214.htm; http:/


series/0558/papers/2408/24080214.

pdf.

Siekmann:2002:ORP

[1385] Jorg Siekmann and Graham Wright-son. An open research problem: Strongcompleteness of R. kowalski’s connec-tion graph proof procedure. LectureNotes in Computer Science, 2408:231–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080231.htm; http:/


series/0558/papers/2408/24080231.

pdf.

Costantini:2002:MRS

[1386] Stefania Costantini. Meta-reasoning:A survey. Lecture Notes in ComputerScience, 2408:253–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2408/24080253.



2408/24080253.pdf.

Dung:2002:ABP

[1387] Phan Minh Dung, Paolo Mancarella,and Francesca Toni. Argumentation-based proof procedures for credulousand sceptical non-monotonic reasoning.Lecture Notes in Computer Science,2408:289–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2408/24080289.htm; http:


series/0558/papers/2408/24080289.

pdf.

Inoue:2002:AA

[1388] Katsumi Inoue. Automated abduction.Lecture Notes in Computer Science,2408:311–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2408/24080311.htm; http:


series/0558/papers/2408/24080311.

pdf.

Prakken:2002:RLC

[1389] Henry Prakken and Giovanni Sar-tor. The role of logic in compu-tational models of legal argument:A critical survey. Lecture Notesin Computer Science, 2408:342–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080342.htm; http:/


series/0558/papers/2408/24080342.

pdf.

Alferes:2002:LPU

[1390] Jose Julio Alferes and Luıs MonizPereira. Logic programming updat-ing — A guided approach. LectureNotes in Computer Science, 2408:382–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080382.htm; http:/


REFERENCES 266

series/0558/papers/2408/24080382.

pdf.

Gelfond:2002:RKP

[1391] Michael Gelfond. Representing knowl-edge in A-prolog. Lecture Notesin Computer Science, 2408:413–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080413.htm; http:/


series/0558/papers/2408/24080413.

pdf.

Miller:2002:SAF

[1392] Rob Miller and Murray Shanahan.Some alternative formulations ofthe event calculus. Lecture Notesin Computer Science, 2408:452–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080452.htm; http:/


series/0558/papers/2408/24080452.

pdf.

Cussens:2002:ILL

[1393] James Cussens. Issues in learninglanguage in logic. Lecture Notesin Computer Science, 2408:491–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080491.htm; http:/


series/0558/papers/2408/24080491.

pdf.

Dahl:2002:IM

[1394] Veronica Dahl. On implicit meanings.Lecture Notes in Computer Science,2408:506–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2408/24080506.htm; http:


series/0558/papers/2408/24080506.

pdf.

Raedt:2002:DMC

[1395] Luc De Raedt. Data mining as con-straint logic programming. LectureNotes in Computer Science, 2408:526–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080526.htm; http:/


series/0558/papers/2408/24080526.

pdf.

Mellish:2002:DPD

[1396] Chris Mellish. DCGs: Parsingas deduction? Lecture Notesin Computer Science, 2408:548–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080548.htm; http:/


series/0558/papers/2408/24080548.

pdf.

Sato:2002:SAT

[1397] Taisuke Sato and Yoshitaka Kameya.Statistical abduction with tabulation.Lecture Notes in Computer Science,

REFERENCES 267



0558/bibs/2408/24080567.htm; http:


series/0558/papers/2408/24080567.

pdf.

Gillies:2002:LDC

[1398] Donald Gillies. Logicism and the de-velopment of computer science. Lec-ture Notes in Computer Science, 2408:588–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080588.htm; http:/


series/0558/papers/2408/24080588.

pdf.

Psillos:2002:SBC

[1399] Stathis Psillos. Simply the best: Acase for abduction. Lecture Notesin Computer Science, 2408:605–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2408/24080605.htm; http:/


series/0558/papers/2408/24080605.

pdf.

Anonymous:2002:AIaaaan




Aragao:2002:IMB

[1401] Marcus Poggi de Aragao and Re-nato F. Werneck. On the implemen-tation of MST-based heuristics for theSteiner problem in graphs. LectureNotes in Computer Science, 2409:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090001.htm; http:/


series/0558/papers/2409/24090001.

pdf.

Phan:2002:TSS

[1402] Vinhthuy Phan, Pavel Sumazin, andSteven Skiena. A time-sensitivesystem for black-box combinato-rial optimization. Lecture Notesin Computer Science, 2409:16–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090016.htm; http:/


series/0558/papers/2409/24090016.

pdf.

Motter:2002:CBF

[1403] DoRon B. Motter and Igor L. Markov.A compressed breadth-first searchfor satisfiability. Lecture Notesin Computer Science, 2409:29–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090029.htm; http:/


series/0558/papers/2409/24090029.

pdf.

REFERENCES 268

Schulz:2002:UML

[1404] Frank Schulz, Dorothea Wagner, andChristos Zaroliagis. Using multi-level graphs for timetable informa-tion in railway systems. LectureNotes in Computer Science, 2409:43–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090043.htm; http:/


series/0558/papers/2409/24090043.

pdf.

Pruhs:2002:ELR

[1405] Kirk Pruhs and Eric Wiewiora. Eval-uating the local ratio algorithm fordynamic storage allocation. LectureNotes in Computer Science, 2409:60–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090060.htm; http:/


series/0558/papers/2409/24090060.

pdf.

Curcio:2002:ESP

[1406] Massimiliano Curcio, Stefano Leonardi,and Andrea Vitaletti. An experimentalstudy of prefetching and caching algo-rithms for the World Wide Web. Lec-ture Notes in Computer Science, 2409:71–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090071.htm; http:/


series/0558/papers/2409/24090071.

pdf.

Gustedt:2002:TJP

[1407] Jens Gustedt, Ole A. Mæhle, andJan Arne Telle. The treewidthof Java programs. Lecture Notesin Computer Science, 2409:86–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090086.htm; http:/


series/0558/papers/2409/24090086.

pdf.

Aleksandrov:2002:PPG

[1408] Lyudmil Aleksandrov, Hristo Djid-jev, Hua Guo, and Anil Mahesh-wari. Partitioning planar graphswith costs and weights. LectureNotes in Computer Science, 2409:98–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090098.htm; http:/


series/0558/papers/2409/24090098.

pdf.

Cattaneo:2002:MDM

[1409] Giuseppe Cattaneo, Pompeo Faruolo,Umberto Ferraro Petrillo, and Giuseppe F.Italiano. Maintaining dynamic min-imum spanning trees: An ex-perimental study. Lecture Notesin Computer Science, 2409:111–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090111.htm; http:/


REFERENCES 269

series/0558/papers/2409/24090111.

pdf.

Pettie:2002:EEN

[1410] Seth Pettie, Vijaya Ramachandran,and Srinath Sridhar. Experimen-tal evaluation of a new shortestpath algorithm. Lecture Notesin Computer Science, 2409:126–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090126.htm; http:/


series/0558/papers/2409/24090126.

pdf.

Chaudhry:2002:GMC

[1411] Geeta Chaudhry and Thomas H.Cormen. Getting more from out-of-core columnsort. Lecture Notesin Computer Science, 2409:143–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090143.htm; http:/


series/0558/papers/2409/24090143.

pdf.

Rafalin:2002:TSD

[1412] Eynat Rafalin, Diane Souvaine, andIleana Streinu. Topological sweepin degenerate cases. Lecture Notesin Computer Science, 2409:155–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090155.htm; http:/


series/0558/papers/2409/24090155.

pdf.

Phillips:2002:AKM

[1413] Steven J. Phillips. Accelerationof K-means and related cluster-ing algorithms. Lecture Notesin Computer Science, 2409:166–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090166.htm; http:/


series/0558/papers/2409/24090166.

pdf.

Procopiuc:2002:STE

[1414] Cecilia M. Procopiuc, Pankaj K. Agar-wal, and Sariel Har-Peled. STAR-Tree: An efficient self-adjusting in-dex for moving objects. LectureNotes in Computer Science, 2409:178–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090178.htm; http:/


series/0558/papers/2409/24090178.

pdf.

Chen:2002:ITS

[1415] Jingchao Chen. An improvement ontree selection sort. Lecture Notesin Computer Science, 2409:194–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2409/24090194.htm; http:/


REFERENCES 270

series/0558/papers/2409/24090194.

pdf.

Anonymous:2002:AIaaaao




Butler:2002:FMN

[1417] Ricky Butler. Formal methodsat NASA langley. Lecture Notesin Computer Science, 2410:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100001.htm; http:/


series/0558/papers/2410/24100001.

pdf.

Huet:2002:HOU

[1418] Gerard Huet. Higher order unification30 years later (extended abstract). Lec-ture Notes in Computer Science, 2410:3–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100003.htm; http:/


series/0558/papers/2410/24100003.

pdf.

Ambler:2002:CHO

[1419] Simon J. Ambler, Roy L. Crole, andAlberto Momigliano. Combining higherorder abstract syntax with tactical the-orem proving and (co)induction. Lec-



bibs/2410/24100013.htm; http:/


series/0558/papers/2410/24100013.

pdf.

Barthe:2002:ERA

[1420] Gilles Barthe and Pierre Courtieu.Efficient reasoning about executablespecifications in Coq. Lecture Notesin Computer Science, 2410:31–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100031.htm; http:/


series/0558/papers/2410/24100031.

pdf.

Basin:2002:VBM

[1421] David Basin, Stefan Friedrich, andMarek Gawkowski. Verified byte-code model checkers. Lecture Notesin Computer Science, 2410:47–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100047.htm; http:/


series/0558/papers/2410/24100047.

pdf.

Bauer:2002:CTI

[1422] Gertrud Bauer and Tobias Nipkow.The 5 colour theorem in Isabelle/Isar.Lecture Notes in Computer Science,2410:67–??, 2002. CODEN LNCSD9.

REFERENCES 271

ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2410/24100067.htm; http:


series/0558/papers/2410/24100067.

pdf.

Bertot:2002:TTF

[1423] Yves Bertot, Venanzio Capretta, andKuntal Das Barman. Type-theoreticfunctional semantics. Lecture Notesin Computer Science, 2410:83–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100083.htm; http:/


series/0558/papers/2410/24100083.

pdf.

Brucker:2002:PFO

[1424] Achim D. Brucker and Burkhart Wolff.A proposal for a formal OCL se-mantics in Isabelle/HOL. LectureNotes in Computer Science, 2410:99–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100099.htm; http:/


series/0558/papers/2410/24100099.

pdf.

Courant:2002:EUC

[1425] Judicael Courant. Explicit universesfor the calculus of constructions. Lec-ture Notes in Computer Science, 2410:115–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100115.htm; http:/


series/0558/papers/2410/24100115.

pdf.

Dawson:2002:FCA

[1426] Jeremy E. Dawson and RajeevGore. Formalised cut admissibil-ity for display logic. Lecture Notesin Computer Science, 2410:131–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100131.htm; http:/


series/0558/papers/2410/24100131.

pdf.

Dehlinger:2002:FTT

[1427] Christophe Dehlinger and Jean-Francois Dufourd. Formalizing thetrading theorem for the classifica-tion of surfaces. Lecture Notesin Computer Science, 2410:148–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100148.htm; http:/


series/0558/papers/2410/24100148.

pdf.

Delahaye:2002:FST

[1428] David Delahaye. Free-style theoremproving. Lecture Notes in ComputerScience, 2410:164–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2410/24100164.

REFERENCES 272



2410/24100164.pdf.

Dennis:2002:CTP

[1429] Louise A. Dennis and Alan Bundy.A comparison of two proof critics:Power vs. robustness. Lecture Notesin Computer Science, 2410:182–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100182.htm; http:/


series/0558/papers/2410/24100182.

pdf.

Felty:2002:TLM

[1430] Amy P. Felty. Two-level meta-reasoning in Coq. Lecture Notesin Computer Science, 2410:198–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100198.htm; http:/


series/0558/papers/2410/24100198.

pdf.

Gordon:2002:PEP

[1431] Michael J. C. Gordon. PuzzleTool:An example of programming compu-tation and deduction. Lecture Notesin Computer Science, 2410:214–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100214.htm; http:/


series/0558/papers/2410/24100214.

pdf.

Hurd:2002:FAP

[1432] Joe Hurd. A formal approach toprobabilistic termination. LectureNotes in Computer Science, 2410:230–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100230.htm; http:/


series/0558/papers/2410/24100230.

pdf.

Mayero:2002:UTP

[1433] Micaela Mayero. Using theorem prov-ing for numerical analysis (correct-ness proof of an automatic differ-entiation algorithm). Lecture Notesin Computer Science, 2410:246–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100246.htm; http:/


series/0558/papers/2410/24100246.

pdf.

Nogin:2002:QTM

[1434] Aleksey Nogin. Quotient types: Amodular approach. Lecture Notesin Computer Science, 2410:263–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100263.htm; http:/


series/0558/papers/2410/24100263.

pdf.

REFERENCES 273

Nogin:2002:SSD

[1435] Aleksey Nogin and Jason Hickey. Se-quent schema for derived rules. Lec-ture Notes in Computer Science, 2410:281–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100281.htm; http:/


series/0558/papers/2410/24100281.

pdf.

Prevosto:2002:ASD

[1436] Virgile Prevosto, Damien Doligez, andTherese Hardin. Algebraic struc-tures and dependent records. LectureNotes in Computer Science, 2410:298–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100298.htm; http:/


series/0558/papers/2410/24100298.

pdf.

Schneider:2002:PEM

[1437] Klaus Schneider. Proving the equiva-lence of microstep and macrostep se-mantics. Lecture Notes in ComputerScience, 2410:314–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2410/24100314.



2410/24100314.pdf.

Zhang:2002:WPG

[1438] Xingyuan Zhang, Malcolm Munro,Mark Harman, and Lin Hu. Weak-

est precondition for general recursiveprograms formalized in Coq. LectureNotes in Computer Science, 2410:332–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2410/24100332.htm; http:/


series/0558/papers/2410/24100332.

pdf.

Anonymous:2002:AIaaaap



papers/2410/24100349.pdf.

Capelle:2002:MFS

[1440] Matthieu Capelle, Cyrille Masson,and Jean-Francois Boulicaut. Min-ing frequent sequential patterns un-der a similarity constraint. LectureNotes in Computer Science, 2412:1–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120001.htm; http:/


series/0558/papers/2412/24120001.

pdf.

Bramer:2002:PPC

[1441] Max Bramer. Pre-pruning clas-sification trees to reduce overfit-ting in noisy domains. LectureNotes in Computer Science, 2412:7–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 274



bibs/2412/24120007.htm; http:/


series/0558/papers/2412/24120007.

pdf.

Smith:2002:DMF

[1442] James F. Smith III. Data min-ing for fuzzy decision tree structurewith a genetic program. LectureNotes in Computer Science, 2412:13–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120013.htm; http:/


series/0558/papers/2412/24120013.

pdf.

Smith:2002:CED

[1443] James F. Smith III. Co-evolutionarydata mining to discover rules forfuzzy resource management. LectureNotes in Computer Science, 2412:19–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120019.htm; http:/


series/0558/papers/2412/24120019.

pdf.

Karimi:2002:DTR

[1444] Kamran Karimi and Howard J. Hamil-ton. Discovering temporal rules fromtemporally ordered data. LectureNotes in Computer Science, 2412:25–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120025.htm; http:/


series/0558/papers/2412/24120025.

pdf.

Hiltunen:2002:API

[1445] Yrjo Hiltunen and Mika Lappalainen.Automated personalisation of Internetusers using self-organising maps. Lec-ture Notes in Computer Science, 2412:31–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120031.htm; http:/


series/0558/papers/2412/24120031.

pdf.

Narita:2002:DAN

[1446] Masaaki Narita, Makoto Haraguchi,and Yoshiaki Okubo. Data ab-stractions for numerical attributesin data mining. Lecture Notesin Computer Science, 2412:35–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120035.htm; http:/


series/0558/papers/2412/24120035.

pdf.

Bhutta:2002:CAR

[1447] Kashif Bhutta. Calculating aggregateswith range-encoded bit-sliced index.Lecture Notes in Computer Science,2412:43–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


REFERENCES 275

0558/bibs/2412/24120043.htm; http:


series/0558/papers/2412/24120043.

pdf.

Tjortjis:2002:TCA

[1448] Christos Tjortjis and John Keane.T3: A classification algorithm for datamining. Lecture Notes in ComputerScience, 2412:50–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2412/24120050.



2412/24120050.pdf.

Hayashi:2002:HMS

[1449] Tomofumi Hayashi, Akio Sato, and Na-dia Berthouze. A hierarchical model tosupport Kansei mining process. Lec-ture Notes in Computer Science, 2412:56–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120056.htm; http:/


series/0558/papers/2412/24120056.

pdf.

Salim:2002:ESQ

[1450] Majid Salim and Xin Yao. EvolvingSQL queries for data mining. LectureNotes in Computer Science, 2412:62–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120062.htm; http:/


series/0558/papers/2412/24120062.

pdf.

Jin:2002:IML

[1451] Xiaoming Jin, Likun Wang, YuchangLu, and Chunyi Shi. Indexing andmining of the local patterns in se-quence database. Lecture Notesin Computer Science, 2412:68–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120068.htm; http:/


series/0558/papers/2412/24120068.

pdf.

Sornkaew:2002:KDF

[1452] Thanakorn Sornkaew and Yasuo Ya-mashita. A knowledge discovery byfuzzy rule based Hopfield network. Lec-ture Notes in Computer Science, 2412:74–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120074.htm; http:/


series/0558/papers/2412/24120074.

pdf.

Rossiter:2002:FPI

[1453] Jonathan Rossiter. Fusing partiallyinconsistent expert and learnt knowl-edge in uncertain hierarchies. LectureNotes in Computer Science, 2412:80–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120080.htm; http:/


REFERENCES 276

series/0558/papers/2412/24120080.

pdf.

Moreale:2002:OIM

[1454] Emanuela Moreale and Stuart Watt.Organisational information manage-ment and knowledge discovery inemail within mailing lists. LectureNotes in Computer Science, 2412:87–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120087.htm; http:/


series/0558/papers/2412/24120087.

pdf.

Klene:2002:DMD

[1455] G. Klene, A. Grauel, H. J. Convey, andA. J. Hartley. Design of multi-drillinggear machines by knowledge process-ing and machine simulation. LectureNotes in Computer Science, 2412:93–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120093.htm; http:/


series/0558/papers/2412/24120093.

pdf.

Zhdanova:2002:CEQ

[1456] Anna V. Zhdanova and Denis V.Shishkin. Classification of email queriesby topic: Approach based on hierarchi-cally structured subject domain. Lec-ture Notes in Computer Science, 2412:99–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120099.htm; http:/


series/0558/papers/2412/24120099.

pdf.

Yang:2002:KBI

[1457] Jaeyoung Yang, Heekuck Oh, Kyung-Goo Doh, and Joongmin Choi. Aknowledge-based information extrac-tion system for semi-structured la-beled documents. Lecture Notesin Computer Science, 2412:105–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120105.htm; http:/


series/0558/papers/2412/24120105.

pdf.

Li:2002:MSS

[1458] Yuhua Li, Zuhair Bandar, and DavidMclean. Measuring semantic similar-ity between words using lexical knowl-edge and neural networks. LectureNotes in Computer Science, 2412:111–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120111.htm; http:/


series/0558/papers/2412/24120111.

pdf.

Carchiolo:2002:EHS

[1459] Vincenza Carchiolo, Alessandro Longheu,and Michele Malgeri. Extraction of hid-den semantics from Web pages. LectureNotes in Computer Science, 2412:117–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 277



bibs/2412/24120117.htm; http:/


series/0558/papers/2412/24120117.

pdf.

Freeman:2002:SOM

[1460] Richard Freeman and Hujun Yin. Self-organising maps for hierarchical treeview document clustering using con-textual information. Lecture Notesin Computer Science, 2412:123–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120123.htm; http:/


series/0558/papers/2412/24120123.

pdf.

He:2002:SDS

[1461] Jianwen He. Schema discovery of thesemi-structured and hierarchical data.Lecture Notes in Computer Science,2412:129–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2412/24120129.htm; http:


series/0558/papers/2412/24120129.

pdf.

Marir:2002:RIR

[1462] Farhi Marir and Kamel Houam.RSTIndex : Indexing and retrievingWeb document using computationaland linguistic techniques. LectureNotes in Computer Science, 2412:135–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2412/24120135.htm; http:/


series/0558/papers/2412/24120135.

pdf.

Umehara:2002:CBR

[1463] Masayuki Umehara, Koji Iwanuma,and Hidetomo Nabeshima. A case-based recognition of semantic struc-tures in HTML documents. LectureNotes in Computer Science, 2412:141–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120141.htm; http:/


series/0558/papers/2412/24120141.

pdf.

Yeow:2002:EXP

[1464] Kelvin Yeow, R. Nigel Horspool,and Michael R. Levy. ExpeditiousXML processing. Lecture Notesin Computer Science, 2412:148–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120148.htm; http:/


series/0558/papers/2412/24120148.

pdf.

Russell:2002:DCU

[1465] Ben Russell, Hujun Yin, and Nigel M.Allinson. Document clustering us-ing the 1 + 1 dimensional self-organising map. Lecture Notesin Computer Science, 2412:154–??,2002. CODEN LNCSD9. ISSN

REFERENCES 278



bibs/2412/24120154.htm; http:/


series/0558/papers/2412/24120154.

pdf.

Kim:2002:NLP

[1466] Sanghee Kim, Wendy Hall, and AndyKeane. Natural language process-ing for expertise modelling in E-mail communication. Lecture Notesin Computer Science, 2412:161–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120161.htm; http:/


series/0558/papers/2412/24120161.

pdf.

Han:2002:BBAb

[1467] Jun Han, Graham McMahon, andStephen Sugden. A branch andbound algorithm for minimum costnetwork flow problem. Lecture Notesin Computer Science, 2412:167–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120167.htm; http:/


series/0558/papers/2412/24120167.

pdf.

Durand:2002:SRU

[1468] Nicolas Durand and Luigi Lancieri.Study of the regularity of the users’Internet accesses. Lecture Notesin Computer Science, 2412:173–??,



bibs/2412/24120173.htm; http:/


series/0558/papers/2412/24120173.

pdf.

Jang:2002:IMC

[1469] Sera Jang and Eunseok Lee. Anintelligent mobile commerce systemwith dynamic contents builder andmobile products browser. LectureNotes in Computer Science, 2412:179–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120179.htm; http:/


series/0558/papers/2412/24120179.

pdf.

Kononen:2002:FCU

[1470] Ville Kononen. Focused crawling us-ing fictitious play. Lecture Notesin Computer Science, 2412:186–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120186.htm; http:/


series/0558/papers/2412/24120186.

pdf.

Lee:2002:UAM

[1471] Eunseok Lee and Sera Jang. Auser adaptive mobile commerce sys-tem with a middlet application. Lec-ture Notes in Computer Science, 2412:193–??, 2002. CODEN LNCSD9. ISSN

REFERENCES 279



bibs/2412/24120193.htm; http:/


series/0558/papers/2412/24120193.

pdf.

Prasad:2002:WVB

[1472] Bhanu Prasad. Weight-vector basedapproach for product recommenda-tion in E-commerce. Lecture Notesin Computer Science, 2412:200–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120200.htm; http:/


series/0558/papers/2412/24120200.

pdf.

Huang:2002:DXB

[1473] Shi-Ming Huang and Chun-Hao Su.The development of an XML-baseddata warehouse system. Lecture Notesin Computer Science, 2412:206–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120206.htm; http:/


series/0558/papers/2412/24120206.

pdf.

Koncilia:2002:IDS

[1474] Christian Koncilia and Heinz Poze-waunig. Identifying data sourcesfor data warehouses. Lecture Notesin Computer Science, 2412:213–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2412/24120213.htm; http:/


series/0558/papers/2412/24120213.

pdf.

Lynden:2002:CLA

[1475] Steven Lynden and Omer F. Rana.Coordinating learning agents viautility assignment. Lecture Notesin Computer Science, 2412:219–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120219.htm; http:/


series/0558/papers/2412/24120219.

pdf.

Dessi:2002:AAA

[1476] Nicoletta Dessı. AGILE: An agent-assisted infrastructure to supportlearning environments. Lecture Notesin Computer Science, 2412:225–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120225.htm; http:/


series/0558/papers/2412/24120225.

pdf.

Smith:2002:MAF

[1477] James F. Smith III. Multi-agentfuzzy logic resource manager. LectureNotes in Computer Science, 2412:231–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 280

bibs/2412/24120231.htm; http:/


series/0558/papers/2412/24120231.

pdf.

Ye:2002:TMA

[1478] Xinfeng Ye, John Keane, andGuoqing Zhang. Transactionalmultiple agents. Lecture Notesin Computer Science, 2412:237–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120237.htm; http:/


series/0558/papers/2412/24120237.

pdf.

Kasiran:2002:IMM

[1479] Mohd Khairudin Kasiran and FaridMeziane. An information modelfor a merchant trust agent in elec-tronic commerce. Lecture Notesin Computer Science, 2412:243–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120243.htm; http:/


series/0558/papers/2412/24120243.

pdf.

Trajkovski:2002:MCS

[1480] Goran Trajkovski. MASIVE: A casestudy in multiagent systems. LectureNotes in Computer Science, 2412:249–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120249.htm; http:/


series/0558/papers/2412/24120249.

pdf.

Wright:2002:LMA

[1481] W. Andy Wright. Learning multi-agent strategies in multi-stage col-laborative games. Lecture Notesin Computer Science, 2412:255–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120255.htm; http:/


series/0558/papers/2412/24120255.

pdf.

Li:2002:ESS

[1482] Ling Li, Alcherio Martinoli, andYaser S. Abu-Mostafa. Emergent spe-cialization in swarm systems. LectureNotes in Computer Science, 2412:261–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120261.htm; http:/


series/0558/papers/2412/24120261.

pdf.

Feng:2002:DMC

[1483] J. Q. Feng, D. P. Buse, Q. H. Wu,and J. Fitch. Distributed mobile com-munication base station diagnosis andmonitoring using multi-agents. LectureNotes in Computer Science, 2412:267–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120267.htm; http:/

REFERENCES 281


series/0558/papers/2412/24120267.

pdf.

Perrone:2002:AAB

[1484] Alessandro Perrone and Gianluigi Fer-raris. ABBA — agent based beaver ap-plication — busy beaver in swarm. Lec-ture Notes in Computer Science, 2412:273–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120273.htm; http:/


series/0558/papers/2412/24120273.

pdf.

Gabbai:2002:CDO

[1485] J. M. E. Gabbai, W. A. Wright, andN. M. Allinson. Centralised and dis-tributed organisational control. Lec-ture Notes in Computer Science, 2412:279–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120279.htm; http:/


series/0558/papers/2412/24120279.

pdf.

Xu:2002:MDS

[1486] Lei Xu. Mining dependence structuresfrom statistical learning perspective.Lecture Notes in Computer Science,2412:285–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2412/24120285.htm; http:


series/0558/papers/2412/24120285.

pdf.

Cheung:2002:MGM

[1487] Yiu ming Cheung. k-means — A gen-eralized k-means clustering algorithmwith unknown cluster number. LectureNotes in Computer Science, 2412:307–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120307.htm; http:/


series/0558/papers/2412/24120307.

pdf.

Jin:2002:MSM

[1488] Xiaolong Jin and Jiming Liu. Multi-agent SAT (MASSAT): Autonomouspattern search in constrained domains.Lecture Notes in Computer Science,2412:318–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2412/24120318.htm; http:


series/0558/papers/2412/24120318.

pdf.

Zhong:2002:TMA

[1489] Ning Zhong, Takahisa Matsunaga, andChunnian Liu. A text mining agentsbased architecture for personal E-mailfiltering and management. LectureNotes in Computer Science, 2412:329–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120329.htm; http:/


REFERENCES 282

series/0558/papers/2412/24120329.

pdf.

Zhong:2002:FMA

[1490] Ning Zhong, Yasuaki Matsui, Tomo-hiro Okuno, and Chunnian Liu. Frame-work of a multi-agent KDD system.Lecture Notes in Computer Science,2412:337–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2412/24120337.htm; http:


series/0558/papers/2412/24120337.

pdf.

Dempster:2002:IFT

[1491] M. A. H. Dempster and Y. S. Romahi.Intraday FX trading: An evolutionaryreinforcement learning approach. Lec-ture Notes in Computer Science, 2412:347–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120347.htm; http:/


series/0558/papers/2412/24120347.

pdf.

Baek:2002:TDU

[1492] Jinwoo Baek and Sungzoon Cho. Anup-trend detection using an auto-associative neural network: KOSPI 200futures. Lecture Notes in ComputerScience, 2412:359–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2412/24120359.



2412/24120359.pdf.

Chiu:2002:SPI

[1493] Kai Chun Chiu and Lei Xu. Stockprice and index forecasting by ar-bitrage pricing theory-based Gaus-sian TFA learning. Lecture Notesin Computer Science, 2412:366–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120366.htm; http:/


series/0558/papers/2412/24120366.

pdf.

Liu:2002:CST

[1494] Zhiyong Liu and Lei Xu. A compar-ative study on three MAP factor es-timate approaches for NFA. LectureNotes in Computer Science, 2412:372–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120372.htm; http:/


series/0558/papers/2412/24120372.

pdf.

Kim:2002:NCF

[1495] Min-Jung Kim and Taek-Soo Kim.A neural classifier with fraud den-sity map for effective credit cardfraud detection. Lecture Notesin Computer Science, 2412:378–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120378.htm; http:/

REFERENCES 283


series/0558/papers/2412/24120378.

pdf.

Lora:2002:CTT

[1496] Alicia Troncoso Lora, Jesus RiquelmeSantos, Jose RiquelmeSantos, An-tonio Gomez Exposito, and JoseLuıs Martınez Ramos. A compar-ison of two techniques for next-dayelectricity price forecasting. LectureNotes in Computer Science, 2412:384–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120384.htm; http:/


series/0558/papers/2412/24120384.

pdf.

Yang:2002:SVM

[1497] Haiqin Yang, Laiwan Chan, andIrwin King. Support vector ma-chine regression for volatile stockmarket prediction. Lecture Notesin Computer Science, 2412:391–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120391.htm; http:/


series/0558/papers/2412/24120391.

pdf.

Han:2002:CPF

[1498] Ying Han and Colin Fyfe. Complexitypursuit for financial prediction. Lec-ture Notes in Computer Science, 2412:397–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120397.htm; http:/


series/0558/papers/2412/24120397.

pdf.

Chan:2002:AIP

[1499] Man-Chung Chan, Chi-Cheong Wong,W. F. Tse, Bernard K.-S. Cheung, andGordon Y.-N. Tang. Artificial intelli-gence in portfolio management. Lec-ture Notes in Computer Science, 2412:403–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120403.htm; http:/


series/0558/papers/2412/24120403.

pdf.

Magdon-Ismail:2002:MCP

[1500] Malik Magdon-Ismail, Hung-Ching (Justin)Chen, and Yaser S. Abu-Mostafa.The multilevel classification problemand a monotonicity hint. LectureNotes in Computer Science, 2412:410–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120410.htm; http:/


series/0558/papers/2412/24120410.

pdf.

Lynch:2002:AFG

[1501] Paul E. Lynch and Nigel M. Allinson.Adaptive filtering for GARCH models.Lecture Notes in Computer Science,2412:416–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.

REFERENCES 284


0558/bibs/2412/24120416.htm; http:


series/0558/papers/2412/24120416.

pdf.

Pulkkinen:2002:ASO

[1502] Juhani Pulkkinen, Mika Lappalainen,Anna-Maija Hakkinen, Nina Lund-bom, Risto A. Kauppinen, and YrjoHiltunen. Application of self-organisingmaps in automated chemical shift cor-rection of in vivo H MR spectra. Lec-ture Notes in Computer Science, 2412:423–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120423.htm; http:/


series/0558/papers/2412/24120423.

pdf.

Spasic:2002:SLT

[1503] Irena Spasic, Goran Nenadic, KostasManios, and Sophia Ananiadou. Super-vised learning of term similarities. Lec-ture Notes in Computer Science, 2412:429–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120429.htm; http:/


series/0558/papers/2412/24120429.

pdf.

Lopez-Alonso:2002:BKE

[1504] Victoria Lopez-Alonso, Lucia Moreno,Guillermo Lopez-Campos, VictorMaojo, and Fernando Martın-Sanchez.BIKMAS: A knowledge engineeringsystem for bioinformatics. Lecture



bibs/2412/24120435.htm; http:/


series/0558/papers/2412/24120435.

pdf.

Ladroue:2002:UFE

[1505] C. Ladroue, A. R. Tate, F. A. Howe,and J. R. Griffiths. Unsupervised fea-ture extraction of in vivo magnetic res-onance spectra of brain tumours usingindependent component analysis. Lec-ture Notes in Computer Science, 2412:441–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120441.htm; http:/


series/0558/papers/2412/24120441.

pdf.

Supekar:2002:FRB

[1506] K. Supekar, A. Marwadi, Y. Lee, andD. Medhi. Fuzzy rule-based frameworkfor medical record validation. LectureNotes in Computer Science, 2412:447–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120447.htm; http:/


series/0558/papers/2412/24120447.

pdf.

Hwang:2002:CLD

[1507] Grace J. Hwang and Chun-Chan Tung.Classification learning by decomposi-

REFERENCES 285

tion of numerical datasets. LectureNotes in Computer Science, 2412:454–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120454.htm; http:/


series/0558/papers/2412/24120454.

pdf.

Bao:2002:CFS

[1508] Yongguang Bao, Xiaoyong Du, andNaohiro Ishii. Combining fea-ture selection with feature weightingfor k-NN classifier. Lecture Notesin Computer Science, 2412:461–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120461.htm; http:/


series/0558/papers/2412/24120461.

pdf.

Shin:2002:PSS

[1509] Hyunjung Shin and Sungzoon Cho.Pattern selection for support vectorclassifiers. Lecture Notes in ComputerScience, 2412:469–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2412/24120469.



2412/24120469.pdf.

Chang:2002:GFS

[1510] Yuan chin Ivan Chang, Haoran Hsu,and Lin-Yi Chou. Graphical fea-tures selection method. Lecture Notes



bibs/2412/24120475.htm; http:/


series/0558/papers/2412/24120475.

pdf.

Crockett:2002:FNI

[1511] Keeley Crockett, Zuhair Bandar, andJames O’Shea. Fuzzy-neural infer-ence in decision trees. Lecture Notesin Computer Science, 2412:481–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120481.htm; http:/


series/0558/papers/2412/24120481.

pdf.

Yook:2002:DTB

[1512] Dongsuk Yook. Decision treebased clustering. Lecture Notesin Computer Science, 2412:487–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120487.htm; http:/


series/0558/papers/2412/24120487.

pdf.

Levashenko:2002:UNI

[1513] Vitaly G. Levashenko and Elena N.Zaitseva. Usage of new informa-tion estimations for induction offuzzy decision trees. Lecture Notesin Computer Science, 2412:493–??,

REFERENCES 286



bibs/2412/24120493.htm; http:/


series/0558/papers/2412/24120493.

pdf.

BinI:2002:GAB

[1514] Bin LI and Zhen quan Zhuang. Ge-netic algorithm based-on the quan-tum probability representation. Lec-ture Notes in Computer Science, 2412:500–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120500.htm; http:/


series/0558/papers/2412/24120500.

pdf.

Hwang:2002:DMD

[1515] Grace J. Hwang and Fumin Li. Adynamic method for discretization ofcontinuous attributes. Lecture Notesin Computer Science, 2412:506–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120506.htm; http:/


series/0558/papers/2412/24120506.

pdf.

Fyfe:2002:NNI

[1516] Colin Fyfe and Emilio Corchado. Anew neural implementation of ex-ploratory projection pursuit. LectureNotes in Computer Science, 2412:512–??, 2002. CODEN LNCSD9. ISSN



bibs/2412/24120512.htm; http:/


series/0558/papers/2412/24120512.

pdf.

Kaban:2002:GFP

[1517] Ata Kaban, Peter Tino, and MarkGirolami. A general framework fora principled hierarchical visualizationof multivariate data. Lecture Notesin Computer Science, 2412:518–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120518.htm; http:/


series/0558/papers/2412/24120518.

pdf.

Singh:2002:CCR

[1518] Sameer Singh, Adnan Amin, andK. C. Sum. Chinese character recog-nition — comparison of classifica-tion methodologies. Lecture Notesin Computer Science, 2412:524–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120524.htm; http:/


series/0558/papers/2412/24120524.

pdf.

Iwata:2002:LZC

[1519] Kazunori Iwata and Naohiro Ishii.Lempel–Ziv coding in reinforce-ment learning. Lecture Notesin Computer Science, 2412:531–??,

REFERENCES 287



bibs/2412/24120531.htm; http:/


series/0558/papers/2412/24120531.

pdf.

Kim:2002:EFE

[1520] Jong-Bae Kim, Chae-Hyun Moon, andHang-Joon Kim. Efficient face ex-traction using skin-color model anda neural network. Lecture Notesin Computer Science, 2412:538–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120538.htm; http:/


series/0558/papers/2412/24120538.

pdf.

Ding:2002:FWD

[1521] Shan Ding and Naohiro Ishii. Fea-ture weights determining of pat-tern classification by using a roughgenetic algorithm with fuzzy sim-ilarity measure. Lecture Notesin Computer Science, 2412:544–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120544.htm; http:/


series/0558/papers/2412/24120544.

pdf.

Dokur:2002:RFD

[1522] Zumray Dokur and Tamer Olmez. Re-cursive form of the discrete Fourier

transform for two-dimensional signals.Lecture Notes in Computer Science,2412:551–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2412/24120551.htm; http:


series/0558/papers/2412/24120551.

pdf.

Lee:2002:VRE

[1523] Soonkyu Lee and Dongsuk Yook.Viseme recognition experiment us-ing context dependent hidden Markovmodels. Lecture Notes in ComputerScience, 2412:557–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2412/24120557.



2412/24120557.pdf.

Miyao:2002:SEP

[1524] Hidetoshi Miyao. Stave extractionfor printed music scores. LectureNotes in Computer Science, 2412:562–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120562.htm; http:/


series/0558/papers/2412/24120562.

pdf.

Jin:2002:SMB

[1525] Huidong Jin, Kwong-Sak Leung, andMan-Leung Wong. Scaling-up model-based clustering algorithm by work-ing on clustering features. Lecture

REFERENCES 288



bibs/2412/24120569.htm; http:/


series/0558/papers/2412/24120569.

pdf.

Liu:2002:NAH

[1526] Yang Liu, Huanqiang Zhang, andZhimei Wu. A new approach to hi-erarchically retrieve MPEG video. Lec-ture Notes in Computer Science, 2412:576–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120576.htm; http:/


series/0558/papers/2412/24120576.

pdf.

Parkins:2002:ABS

[1527] Paul Parkins and John A. Keane.Alpha-beta search revisited. LectureNotes in Computer Science, 2412:582–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2412/24120582.htm; http:/


series/0558/papers/2412/24120582.

pdf.

Wang:2002:QRI

[1528] Wenjia Wang. Quantifying relevanceof input features. Lecture Notesin Computer Science, 2412:588–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2412/24120588.htm; http:/


series/0558/papers/2412/24120588.

pdf.

Anonymous:2002:AIaaaaq




Boella:2002:ANR

[1530] Guido Boella and Rossana Dami-ano. An architecture for norma-tive reactive agents. Lecture Notesin Computer Science, 2413:1–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130001.htm; http:/


series/0558/papers/2413/24130001.

pdf.

Lee:2002:RTA

[1531] Jimmy H. M. Lee and Lei Zhao. Areal-time agent architecture: Design,implementation and evaluation. Lec-ture Notes in Computer Science, 2413:18–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130018.htm; http:/


series/0558/papers/2413/24130018.

pdf.

REFERENCES 289

Takashina:2002:ILA

[1532] Tomomi Takashina, Kazuhide Tanaka,and Shigeyoshi Watanabe. In-dividual level analysis using deci-sion making features in multiagentbased simulation. Lecture Notesin Computer Science, 2413:33–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130033.htm; http:/


series/0558/papers/2413/24130033.

pdf.

Terada:2002:FNP

[1533] Kenji Terada and Makoto Yokoo.False-name-proof multi-unit auctionprotocol utilizing greedy allocationbased on approximate evaluation val-ues. Lecture Notes in Computer Sci-ence, 2413:48–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2413/24130048.



2413/24130048.pdf.

Chen:2002:DAM

[1534] Wei Chen and Keith Decker. De-veloping alternative mechanisms formultiagent coordination. LectureNotes in Computer Science, 2413:63–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130063.htm; http:/


series/0558/papers/2413/24130063.

pdf.

Jmaiel:2002:OSN

[1535] Mohamed Jmaiel and Ahmed HadjKacem. An operational seman-tics for negotiating agents. LectureNotes in Computer Science, 2413:77–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130077.htm; http:/


series/0558/papers/2413/24130077.

pdf.

Serrano:2002:OMD

[1536] Juan Manuel Serrano and Sascha Os-sowski. An organizational meta-model for the design of cataloguesof communicative actions. LectureNotes in Computer Science, 2413:92–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130092.htm; http:/


series/0558/papers/2413/24130092.

pdf.

Mathieu:2002:PDM

[1537] Philippe Mathieu, Jean-ChristopheRoutier, and Yann Secq. Principlesfor dynamic multi-agent organizations.Lecture Notes in Computer Science,2413:109–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2413/24130109.htm; http:


REFERENCES 290

series/0558/papers/2413/24130109.

pdf.

Soo:2002:CDD

[1538] Von-Wun Soo and Hai-Long Cheng.Conducting the disambiguation dia-logues between software agent sellersand human buyers. Lecture Notesin Computer Science, 2413:123–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130123.htm; http:/


series/0558/papers/2413/24130123.

pdf.

Yamada:2002:MLM

[1539] Seiji Yamada and Tomohiro Yam-aguchi. Mutual learning of mindreading between a human anda life-like agent. Lecture Notesin Computer Science, 2413:138–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130138.htm; http:/


series/0558/papers/2413/24130138.

pdf.

Shim:2002:ASS

[1540] Yunju Shim and Minkoo Kim. Au-tomatic short story generator basedon autonomous agents. Lecture Notesin Computer Science, 2413:151–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130151.htm; http:/


series/0558/papers/2413/24130151.

pdf.

Gao:2002:MLA

[1541] Zhiqiang Gao, Tomoyuki Kawasoe, Ak-ishige Yamamoto, and Toru Ishida.Meta-level architecture for execut-ing multi-agent scenarios. LectureNotes in Computer Science, 2413:163–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130163.htm; http:/


series/0558/papers/2413/24130163.

pdf.

Kitagata:2002:AOF

[1542] Gen Kitagata, Takuo Suganuma,and Tetsuo Kinoshita. Application-oriented flow control in agent-basednetwork middleware. Lecture Notesin Computer Science, 2413:178–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2413/24130178.htm; http:/


series/0558/papers/2413/24130178.

pdf.

Sawamoto:2002:CTD

[1543] Jun Sawamoto, Hidekazu Tsuji, andHisao Koizumi. Continuous truck de-livery scheduling and execution sys-tem with multiple agents. LectureNotes in Computer Science, 2413:190–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 291


bibs/2413/24130190.htm; http:/


series/0558/papers/2413/24130190.

pdf.

Liu:2002:DAC

[1544] Jyi-Shane Liu. Designing agents forcontext-rich textual information tasks.Lecture Notes in Computer Science,2413:205–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2413/24130205.htm; http:


series/0558/papers/2413/24130205.

pdf.

Anonymous:2002:AIaaaar




Raman:2002:SMS

[1546] Bhaskaran Raman, Sharad Agarwal,Yan Chen, Matthew Caesar, Wei-dong Cui, Per Johansson, KevinLai, Tal Lavian, Sridhar Machi-raju, Z. Morley Mao, George Porter,Timothy Roscoe, Mukund Seshadri,Jimmy Shih, Keith Sklower, Laksh-minarayanan Subramanian, TakashiSuzuki, Shelley Zhuang, Anthony D.Joseph, Randy H. Katz, and Ion Stoica.The SAHARA model for service com-position across multiple providers. Lec-ture Notes in Computer Science, 2414:1–??, 2002. CODEN LNCSD9. ISSN



bibs/2414/24140001.htm; http:/


series/0558/papers/2414/24140001.

pdf.

Herrtwich:2002:UCA

[1547] Ralf G. Herrtwich. Ubiquitouscomputing in the automotive do-main (abstract). Lecture Notesin Computer Science, 2414:15–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140015.htm; http:/


series/0558/papers/2414/24140015.

pdf.

Hess:2002:BAU

[1548] Christopher K. Hess, Manuel Roman,and Roy H. Campbell. Buildingapplications for ubiquitous comput-ing environments. Lecture Notesin Computer Science, 2414:16–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140016.htm; http:/


series/0558/papers/2414/24140016.

pdf.

Arnstein:2002:SSU

[1549] Larry Arnstein, Robert Grimm, Chia-Yang Hung, Jong Hee Kang, AnthonyLaMarca, Gary Look, Stefan B. Sig-urdsson, Jing Su, and Gaetano Bor-riello. Systems support for ubiqui-

REFERENCES 292

tous computing: A case study of twoimplementations of labscape. LectureNotes in Computer Science, 2414:30–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140030.htm; http:/


series/0558/papers/2414/24140030.

pdf.

Lueg:2002:GBV

[1550] Christopher Lueg. On the gap be-tween vision and feasibility. LectureNotes in Computer Science, 2414:45–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140045.htm; http:/


series/0558/papers/2414/24140045.

pdf.

Levy:2002:FKP

[1551] David Levy. The fastap keypadand pervasive computing. LectureNotes in Computer Science, 2414:58–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140058.htm; http:/


series/0558/papers/2414/24140058.

pdf.

Bayon:2002:GBS

[1552] Victor Bayon, Tom Rodden, ChrisGreenhalgh, and Steve Benford. Go-ing back to school: Putting a pervasiveenvironment into the real world. Lec-



bibs/2414/24140069.htm; http:/


series/0558/papers/2414/24140069.

pdf.

Ferscha:2002:PWA

[1553] Alois Ferscha and Simon Vogl. Per-vasive Web access via public com-munication walls. Lecture Notesin Computer Science, 2414:84–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140084.htm; http:/


series/0558/papers/2414/24140084.

pdf.

Vogt:2002:EOI

[1554] Harald Vogt. Efficient object identifi-cation with passive RFID tags. LectureNotes in Computer Science, 2414:98–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140098.htm; http:/


series/0558/papers/2414/24140098.

pdf.

Clarke:2002:UCP

[1555] Dwaine Clarke, Blaise Gassend,Thomas Kotwal, Matt Burnside,Marten van Dijk, Srinivas Devadas,and Ronald Rivest. The un-trusted computer problem and camera-

REFERENCES 293

based authentication. Lecture Notesin Computer Science, 2414:114–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140114.htm; http:/


series/0558/papers/2414/24140114.

pdf.

Tuulari:2002:SPU

[1556] Esa Tuulari and Arto Ylisaukko-oja.SoapBox: A platform for ubiquitouscomputing research and applications.Lecture Notes in Computer Science,2414:125–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2414/24140125.htm; http:


series/0558/papers/2414/24140125.

pdf.

Lifton:2002:PCS

[1557] Joshua Lifton, Deva Seetharam,Michael Broxton, and Joseph Paradiso.Pushpin computing system overview:A platform for distributed, embedded,ubiquitous sensor networks. LectureNotes in Computer Science, 2414:139–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140139.htm; http:/


series/0558/papers/2414/24140139.

pdf.

LaMarca:2002:MSN

[1558] Anthony LaMarca, Waylon Brunette,

David Koizumi, Matthew Lease,Stefan B. Sigurdsson, Kevin Siko-rski, Dieter Fox, and Gaetano Bor-riello. Making sensor networks prac-tical with robots. Lecture Notesin Computer Science, 2414:152–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140152.htm; http:/


series/0558/papers/2414/24140152.

pdf.

Henricksen:2002:MCI

[1559] Karen Henricksen, Jadwiga Indulska,and Andry Rakotonirainy. Model-ing context information in pervasivecomputing systems. Lecture Notesin Computer Science, 2414:167–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140167.htm; http:/


series/0558/papers/2414/24140167.

pdf.

Schubiger-Banz:2002:MSC

[1560] Simon Schubiger-Banz and Beat Hirs-brunner. A model for softwareconfiguration in ubiquitous comput-ing environments. Lecture Notesin Computer Science, 2414:181–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140181.htm; http:/


REFERENCES 294

series/0558/papers/2414/24140181.

pdf.

Balazinska:2002:ITS

[1561] Magdalena Balazinska, Hari Balakrish-nan, and David Karger. INS/Twine:A scalable peer-to-peer architecture forintentional resource discovery. LectureNotes in Computer Science, 2414:195–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140195.htm; http:/


series/0558/papers/2414/24140195.

pdf.

Vildjiounaite:2002:LEI

[1562] Elena Vildjiounaite, Esko-JuhaniMalm, Jouni Kaartinen, and PetteriAlahuhta. Location estimation indoorsby means of small computing powerdevices, accelerometers, magnetic sen-sors, and map knowledge. LectureNotes in Computer Science, 2414:211–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140211.htm; http:/


series/0558/papers/2414/24140211.

pdf.

Kubach:2002:EBL

[1563] Uwe Kubach and Kurt Rothermel.Estimating the benefit of location-awareness for mobile data manage-ment mechanisms. Lecture Notesin Computer Science, 2414:225–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2414/24140225.htm; http:/


series/0558/papers/2414/24140225.

pdf.

Nakanishi:2002:IMC

[1564] Yasuto Nakanishi, Kazunari Taka-hashi, Takayuki Tsuji, and KatsuyaHakozaki. iCAMS: A mobile com-munication tool using location andschedule information. Lecture Notesin Computer Science, 2414:239–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140239.htm; http:/


series/0558/papers/2414/24140239.

pdf.

Song:2002:BSR

[1565] Henry Song, Hao hua Chu, Nay-eem Islam, Shoji Kurakake, andMasaji Katagiri. Browser staterepository service. Lecture Notesin Computer Science, 2414:253–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140253.htm; http:/


series/0558/papers/2414/24140253.

pdf.

Hori:2002:ATA

[1566] Masahiro Hori, Kouichi Ono, TeruoKoyanagi, and Mari Abe. Annota-tion by transformation for the au-tomatic generation of content cus-

REFERENCES 295

tomization metadata. Lecture Notesin Computer Science, 2414:267–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140267.htm; http:/


series/0558/papers/2414/24140267.

pdf.

Chen:2002:SDS

[1567] Yan Chen, Randy H. Katz, andJohn D. Kubiatowicz. SCAN: A dy-namic, scalable, and efficient con-tent distribution network. LectureNotes in Computer Science, 2414:282–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2414/24140282.htm; http:/


series/0558/papers/2414/24140282.

pdf.

Anonymous:2002:AIaaaas




Deco:2002:NTV

[1569] Gustavo Deco and Edmund Rolls.A neurodynamical theory of visualattention: Comparisons with fMRI-and single-neuron data. LectureNotes in Computer Science, 2415:3–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2415/24150003.htm; http:/


series/0558/papers/2415/24150003.

pdf.

Molina-Vilaplana:2002:NMS

[1570] Javier Molina-Vilaplana, Jorge FeliuBatlle, and Juan Lopez Coronado.A neural model of spatio temporalcoordination in prehension. LectureNotes in Computer Science, 2415:9–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150009.htm; http:/


series/0558/papers/2415/24150009.

pdf.

Thiel:2002:SDP

[1571] Andreas Thiel, Christian W. Eu-rich, and Helmut Schwegler. Sta-bilized dynamics in physiologicaland neural systems despite stronglydelayed feedback. Lecture Notesin Computer Science, 2415:15–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150015.htm; http:/


series/0558/papers/2415/24150015.

pdf.

Einhauser:2002:LMF

[1572] Wolfgang Einhauser, Christoph Kayser,Konrad P. Kording, and PeterKonig. Learning multiple fea-ture representations from natural

REFERENCES 296

image sequences. Lecture Notesin Computer Science, 2415:21–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150021.htm; http:/


series/0558/papers/2415/24150021.

pdf.

Aguirre:2002:ABI

[1573] Carlos Aguirre, Ramon Huerta, Fer-nando Corbacho, and Pedro Pas-cual. Analysis of biologically in-spired small-world networks. LectureNotes in Computer Science, 2415:27–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150027.htm; http:/


series/0558/papers/2415/24150027.

pdf.

Hurri:2002:RFS

[1574] Jarmo Hurri and Aapo Hyvarinen.Receptive fields similar to simplecells maximize temporal coherencein natural video. Lecture Notesin Computer Science, 2415:33–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150033.htm; http:/


series/0558/papers/2415/24150033.

pdf.

Marinaro:2002:NIS

[1575] Maria Marinaro and Silvia Scar-

petta. Noise induces spontaneoussynchronous aperiodic activity in EIneural networks. Lecture Notesin Computer Science, 2415:39–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150039.htm; http:/


series/0558/papers/2415/24150039.

pdf.

Graham:2002:MFA

[1576] Bruce Graham. Multiple formsof activity-dependent plasticity en-hance information transfer at adynamic synapse. Lecture Notesin Computer Science, 2415:45–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150045.htm; http:/


series/0558/papers/2415/24150045.

pdf.

Caputo:2002:SCK

[1577] Barbara Caputo and Heinrich Nie-mann. Storage capacity of ker-nel associative memories. LectureNotes in Computer Science, 2415:51–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150051.htm; http:/


series/0558/papers/2415/24150051.

pdf.

REFERENCES 297

Lucke:2002:MDU

[1578] Jorg Lucke, Christoph von der Mals-burg, and Rolf P. Wurtz. Macro-columns as decision units. LectureNotes in Computer Science, 2415:57–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150057.htm; http:/


series/0558/papers/2415/24150057.

pdf.

Wennekers:2002:NAS

[1579] Thomas Wennekers. Nonlinear analysisof simple cell tuning in visual cortex.Lecture Notes in Computer Science,2415:63–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24150063.htm; http:


series/0558/papers/2415/24150063.

pdf.

Rowcliffe:2002:CWI

[1580] Phill Rowcliffe, Jianfeng Feng, andHilary Buxton. Clustering withinintegrate-and-fire neurons for im-age segmentation. Lecture Notesin Computer Science, 2415:69–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150069.htm; http:/


series/0558/papers/2415/24150069.

pdf.

Oliveira:2002:SDU

[1581] Rogerio de Oliveira and Luiz Hen-rique Alves Monteiro. Symme-try detection using global-locallycoupled maps. Lecture Notesin Computer Science, 2415:75–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150075.htm; http:/


series/0558/papers/2415/24150075.

pdf.

Berkes:2002:ASF

[1582] Pietro Berkes and Laurenz Wiskott.Applying slow feature analysis to im-age sequences yields a rich repertoireof complex cell properties. LectureNotes in Computer Science, 2415:81–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150081.htm; http:/


series/0558/papers/2415/24150081.

pdf.

Strosslin:2002:CMS

[1583] Thomas Strosslin, Christophe Kreb-ser, Angelo Arleo, and Wulfram Ger-stner. Combining multimodal sensoryinput for spatial learning. LectureNotes in Computer Science, 2415:87–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150087.htm; http:/


REFERENCES 298

series/0558/papers/2415/24150087.

pdf.

Kupper:2002:NNM

[1584] Rudiger Kupper and Reinhard Eck-horn. A neural network model generat-ing invariance for visual distance. Lec-ture Notes in Computer Science, 2415:93–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150093.htm; http:/


series/0558/papers/2415/24150093.

pdf.

Rybak:2002:MNC

[1585] Ilya A. Rybak, Dmitry G. Ivashko,Boris I. Prilutsky, M. Anthony Lewis,and John K. Chapin. Modeling neu-ral control of locomotion: Integrationof reflex circuits with CPG. LectureNotes in Computer Science, 2415:99–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150099.htm; http:/


series/0558/papers/2415/24150099.

pdf.

Nevado:2002:CIE

[1586] Angel Nevado, Malcolm P. Young,and Stefano Panzeri. Compar-ing the information encoded by dif-ferent brain areas with functionalimaging techniques. Lecture Notesin Computer Science, 2415:105–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150105.htm; http:/


series/0558/papers/2415/24150105.

pdf.

Mattia:2002:MFP

[1587] Maurizio Mattia and Paolo Del Giu-dice. Mean-field population dynam-ics of spiking neurons with ran-dom synaptic delays. Lecture Notesin Computer Science, 2415:111–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150111.htm; http:/


series/0558/papers/2415/24150111.

pdf.

Mtetwa:2002:SRF

[1588] Nhamo Mtetwa, Leslie S. Smith, andAmir Hussain. Stochastic resonanceand finite resolution in a network ofleaky integrate-and-fire neurons. Lec-ture Notes in Computer Science, 2415:117–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150117.htm; http:/


series/0558/papers/2415/24150117.

pdf.

Auer:2002:RCD

[1589] Peter Auer, Harald Burgsteiner, andWolfgang Maass. Reducing com-munication for distributed learningin neural networks. Lecture Notesin Computer Science, 2415:123–??,2002. CODEN LNCSD9. ISSN

REFERENCES 299



bibs/2415/24150123.htm; http:/


series/0558/papers/2415/24150123.

pdf.

Dominguez:2002:FDQ

[1590] David R. C. Dominguez, E. Ko-rutcheva, W. K. Theumann, andR. Erichsen Jr. Flow diagrams ofthe quadratic neural network. LectureNotes in Computer Science, 2415:129–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150129.htm; http:/


series/0558/papers/2415/24150129.

pdf.

Mongillo:2002:DPC

[1591] Gianluigi Mongillo and Daniel J.Amit. Dynamics of a plasticcortical network. Lecture Notesin Computer Science, 2415:135–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150135.htm; http:/


series/0558/papers/2415/24150135.

pdf.

Giugliano:2002:NMC

[1592] Michele Giugliano, Giancarlo La Cam-era, Alexander Rauch, Hans-RudolfLuscher, and Stefano Fusi. Non-monotonic current-to-rate responsefunction in a novel integrate-and-

fire model neuron. Lecture Notesin Computer Science, 2415:141–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150141.htm; http:/


series/0558/papers/2415/24150141.

pdf.

Meyer:2002:SWE

[1593] Kris De Meyer, J. Mark Bishop,and Slawomir J. Nasuto. Small-world effects in lattice stochasticdiffusion search. Lecture Notesin Computer Science, 2415:147–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150147.htm; http:/


series/0558/papers/2415/24150147.

pdf.

Iske:2002:DSN

[1594] Burkhard Iske, Axel Loffler, and Ul-rich Ruckert. A direction sensi-tive network based on a biophysi-cal neurone model. Lecture Notesin Computer Science, 2415:153–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150153.htm; http:/


series/0558/papers/2415/24150153.

pdf.

Latorre:2002:CTR

[1595] Roberto Latorre, Francisco B. Rodrıguez,

REFERENCES 300

and Pablo Varona. Characteriza-tion of triphasic rhythms in cen-tral pattern generators (I): Inter-spike interval analysis. Lecture Notesin Computer Science, 2415:160–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150160.htm; http:/


series/0558/papers/2415/24150160.

pdf.

Rodriguez:2002:CTR

[1596] Francisco B. Rodrıguez, Roberto La-torre, and Pablo Varona. Character-ization of triphasic rhythms in cen-tral pattern generators (II): Burst in-formation analysis. Lecture Notesin Computer Science, 2415:167–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150167.htm; http:/


series/0558/papers/2415/24150167.

pdf.

Ferrandez:2002:NCA

[1597] J. M. Ferrandez, M. Bongard,F. Garcıa de Quiros, J. A. Bolea,and E. Fernandez. Neural codinganalysis in retinal ganglion cells us-ing information theory. Lecture Notesin Computer Science, 2415:174–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150174.htm; http:/


series/0558/papers/2415/24150174.

pdf.

Camera:2002:FRA

[1598] Giancarlo La Camera, AlexanderRauch, Walter Senn, Hans-R. Luscher,and Stefano Fusi. Firing rate adap-tation without losing sensitivity toinput fluctuations. Lecture Notesin Computer Science, 2415:180–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150180.htm; http:/


series/0558/papers/2415/24150180.

pdf.

Sterratt:2002:DMI

[1599] David C. Sterratt and Arjen vanOoyen. Does morphology influencetemporal plasticity? Lecture Notesin Computer Science, 2415:186–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150186.htm; http:/


series/0558/papers/2415/24150186.

pdf.

Johansson:2002:ANN

[1600] Christopher Johansson, Anders Sand-berg, and Anders Lansner. Attractorneural networks with hypercolumns.Lecture Notes in Computer Science,2415:192–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24150192.htm; http:

REFERENCES 301


series/0558/papers/2415/24150192.

pdf.

Sanchez:2002:EDM

[1601] Eduardo Sanchez, S. Barro, andA. Canedo. Edge detection and motiondiscrimination in the cuneate nucleus.Lecture Notes in Computer Science,2415:198–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24150198.htm; http:


series/0558/papers/2415/24150198.

pdf.

Viretta:2002:ETS

[1602] Alessandro Usseglio Viretta, StefanoFusi, and Shih-Chii Liu. Encod-ing the temporal statistics of Marko-vian sequences of stimuli in recur-rent neuronal networks. Lecture Notesin Computer Science, 2415:204–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150204.htm; http:/


series/0558/papers/2415/24150204.

pdf.

Charles:2002:MSE

[1603] Darryl Charles, Jos Koetsier, DonaldMacDonald, and Colin Fyfe. Multi-stream exploratory projection pursuitfor the formation of complex cells sim-ilar to visual cortical neurons. LectureNotes in Computer Science, 2415:210–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2415/24150210.htm; http:/


series/0558/papers/2415/24150210.

pdf.

Garcia-Cordova:2002:CNC

[1604] Francisco Garcıa-Cordova, JavierMolina-Vilaplana, and Juan Lopez-Coronado. A corticospinal net-work for control of voluntary move-ments of a physiologically based ex-perimental platform. Lecture Notesin Computer Science, 2415:216–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150216.htm; http:/


series/0558/papers/2415/24150216.

pdf.

Moreno:2002:FRG

[1605] Ruben Moreno and Nestor Parga.Firing rate for a generic integrate-and-fire neuron with exponentiallycorrelated input. Lecture Notesin Computer Science, 2415:223–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150223.htm; http:/


series/0558/papers/2415/24150223.

pdf.

Otterpohl:2002:IPD

[1606] Jens R. Otterpohl and K. Pawelzik.Iterative population decoding basedon prior beliefs. Lecture Notes

REFERENCES 302



bibs/2415/24150229.htm; http:/


series/0558/papers/2415/24150229.

pdf.

Camera:2002:WNR

[1607] Giancarlo La Camera, Stefano Fusi,Walter Senn, Alexander Rauch, andHans-R. Luscher. When NMDA re-ceptor conductances increase inter-spike interval variability. LectureNotes in Computer Science, 2415:235–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150235.htm; http:/


series/0558/papers/2415/24150235.

pdf.

Fusi:2002:SDS

[1608] Stefano Fusi. Spike-driven synapticplasticity for learning correlated pat-terns of asynchronous activity. LectureNotes in Computer Science, 2415:241–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150241.htm; http:/


series/0558/papers/2415/24150241.

pdf.

Sanchez-Montanes:2002:MHC

[1609] Manuel Sanchez-Montanes, Luis F.Lago-Fernandez, Nazareth P. Castel-

lanos, Angel Merchan-Perez, Jon I.Arellano, and Javier DeFelipe. Amodel of human cortical microcir-cuits for the study of the devel-opment of epilepsy. Lecture Notesin Computer Science, 2415:248–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150248.htm; http:/


series/0558/papers/2415/24150248.

pdf.

Maass:2002:CPN

[1610] Wolfgang Maass. On the computa-tional power of neural microcircuitmodels: Pointers to the literature. Lec-ture Notes in Computer Science, 2415:254–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150254.htm; http:/


series/0558/papers/2415/24150254.

pdf.

Gelenbe:2002:NCP

[1611] Erol Gelenbe, Ricardo Lent, andZhiguang Xu. Networking withcognitive packets. Lecture Notesin Computer Science, 2415:259–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150259.htm; http:/


series/0558/papers/2415/24150259.

pdf.

REFERENCES 303

Wallace:2002:EMC

[1612] J. G. Wallace and K. Bluff. Episodicmemory: A connectionist interpreta-tion. Lecture Notes in Computer Sci-ence, 2415:265–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2415/24150265.



2415/24150265.pdf.

Frezza-Buet:2002:ASS

[1613] Herve Frezza-Buet. Action schemescheduling with a neural architecture:A prefrontal cortex approach. LectureNotes in Computer Science, 2415:271–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150271.htm; http:/


series/0558/papers/2415/24150271.

pdf.

Stoianov:2002:AAB

[1614] Ivilin Stoianov, Marco Zorzi, SuzannaBecker, and Carlo Umilta. As-sociative arithmetic with Boltz-mann machines: The role of num-ber representations. Lecture Notesin Computer Science, 2415:277–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150277.htm; http:/


series/0558/papers/2415/24150277.

pdf.

Eck:2002:LLT

[1615] Douglas Eck and Jurgen Schmidhu-ber. Learning the long-term struc-ture of the blues. Lecture Notesin Computer Science, 2415:284–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150284.htm; http:/


series/0558/papers/2415/24150284.

pdf.

Bua:2002:RNN

[1616] Antonella Bua, Marco Gori, andFabrizio Santini. Recursive neuralnetworks applied to discourse rep-resentation theory. Lecture Notesin Computer Science, 2415:290–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150290.htm; http:/


series/0558/papers/2415/24150290.

pdf.

Garfield:2002:RNL

[1617] Sheila Garfield and Stefan Wermter.Recurrent neural learning for helpdeskcall routing. Lecture Notes in Com-puter Science, 2415:296–??, 2002. CO-DEN LNCSD9. ISSN 0302-9743(print), 1611-3349 (electronic). URLhttp://link.springer-ny.com/link/




2415/24150296.pdf.

REFERENCES 304

Korczak:2002:AEM

[1618] Jerzy Korczak and Emmanuel Blin-dauer. An approach to encode mul-tilayer perceptrons. Lecture Notesin Computer Science, 2415:302–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150302.htm; http:/


series/0558/papers/2415/24150302.

pdf.

Bishop:2002:DKR

[1619] J. Mark Bishop, Slawomir J. Na-suto, and Kris De Meyer. Dy-namic knowledge representation in con-nectionist systems. Lecture Notesin Computer Science, 2415:308–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150308.htm; http:/


series/0558/papers/2415/24150308.

pdf.

Gutierrez:2002:GCC

[1620] German Gutierrez, Ines M. Galvan,Jose M. Molina, and Araceli San-chis. Generative capacities of cel-lular automata codification for evo-lution of NN codification. LectureNotes in Computer Science, 2415:314–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150314.htm; http:/


series/0558/papers/2415/24150314.

pdf.

Buldain:2002:EMR

[1621] J. David Buldain. Entropic mea-sures with radial basis units. LectureNotes in Computer Science, 2415:323–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150323.htm; http:/


series/0558/papers/2415/24150323.

pdf.

Sonnenburg:2002:NMS

[1622] Soren Sonnenburg, Gunnar Ratsch,Arun Jagota, and Klaus-RobertMuller. New methods for splicesite recognition. Lecture Notesin Computer Science, 2415:329–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150329.htm; http:/


series/0558/papers/2415/24150329.

pdf.

Ito:2002:WCL

[1623] Yoshifusa Ito. A weak conditionon linear independence of unscaledshifts of a function and finite map-pings by neural networks. LectureNotes in Computer Science, 2415:337–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150337.htm; http:/


REFERENCES 305

series/0558/papers/2415/24150337.

pdf.

Azhar:2002:IWM

[1624] Ali Syed Saad Azhar and Hus-sain N. Al-Duwaish. Identificationof Wiener model using radial basisfunctions neural networks. LectureNotes in Computer Science, 2415:344–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150344.htm; http:/


series/0558/papers/2415/24150344.

pdf.

Welling:2002:NLA

[1625] Max Welling and Geoffrey E. Hinton.A new learning algorithm for meanfield Boltzmann machines. LectureNotes in Computer Science, 2415:351–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150351.htm; http:/


series/0558/papers/2415/24150351.

pdf.

Chen:2002:CRB

[1626] Hsin Chen and Alan Murray. Acontinuous restricted Boltzmann ma-chine with a hardware-amenablelearning algorithm. Lecture Notesin Computer Science, 2415:358–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150358.htm; http:/


series/0558/papers/2415/24150358.

pdf.

Herrero-Jaraba:2002:HRG

[1627] J. Elıas Herrero-Jaraba, Carlos Orrite-Urunuela, David Buldain, and Ar-mando Roy-Yarza. Human recognitionby gait analysis using neural networks.Lecture Notes in Computer Science,2415:364–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24150364.htm; http:


series/0558/papers/2415/24150364.

pdf.

Hammer:2002:LVQ

[1628] Barbara Hammer, Marc Strickert, andThomas Villmann. Learning vectorquantization for multimodal data. Lec-ture Notes in Computer Science, 2415:370–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150370.htm; http:/


series/0558/papers/2415/24150370.

pdf.

Galicki:2002:LDN

[1629] Miros law Galicki, Lutz Leistritz, andHerbert Witte. Learning the dynamicneural networks with the improvementof generalization capabilities. LectureNotes in Computer Science, 2415:377–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 306

bibs/2415/24150377.htm; http:/


series/0558/papers/2415/24150377.

pdf.

Bakker:2002:MCN

[1630] Bart Bakker and Tom Heskes.Model clustering for neural net-work ensembles. Lecture Notesin Computer Science, 2415:383–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150383.htm; http:/


series/0558/papers/2415/24150383.

pdf.

Martin:2002:DCP

[1631] Jose Luis Fernandez-Villacanas Martınand Monica Sierra Sanchez. Doescrossover probability depend on fit-ness and Hamming differences in ge-netic algorithms? Lecture Notesin Computer Science, 2415:389–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150389.htm; http:/


series/0558/papers/2415/24150389.

pdf.

Besada-Juez:2002:EFR

[1632] Jesus Manuel Besada-Juez and Miguel A.Sanz-Bobi. Extraction of fuzzyrules using sensibility analysis ina neural network. Lecture Notesin Computer Science, 2415:395–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2415/24150395.htm; http:/


series/0558/papers/2415/24150395.

pdf.

Albrecht:2002:SAR

[1633] Andreas A. Albrecht, Staal A. Vin-terbo, C. K. Wong, and LucilaOhno-Machado. A simulated an-nealing and resampling method fortraining perceptrons to classify gene-expression data. Lecture Notesin Computer Science, 2415:401–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150401.htm; http:/


series/0558/papers/2415/24150401.

pdf.

Alaiz-Rodriguez:2002:NMC

[1634] Rocıo Alaiz-Rodrıguez and Jesus Cid-Sueiro. Neural minimax classifiers. Lec-ture Notes in Computer Science, 2415:408–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150408.htm; http:/


series/0558/papers/2415/24150408.

pdf.

Lauer:2002:SPE

[1635] Martin Lauer. Sampling parame-ters to estimate a mixture distribu-tion with unknown size. LectureNotes in Computer Science, 2415:414–??, 2002. CODEN LNCSD9. ISSN

REFERENCES 307



bibs/2415/24150414.htm; http:/


series/0558/papers/2415/24150414.

pdf.

Verikas:2002:SNN

[1636] Antanas Verikas, Arunas Lipnickas,and Kerstin Malmqvist. Select-ing neural networks for making acommittee decision. Lecture Notesin Computer Science, 2415:420–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150420.htm; http:/


series/0558/papers/2415/24150420.

pdf.

Fleury:2002:HAM

[1637] Patrice Fleury, Alan F. Murray, andMartin Reekie. High-accuracy mixed-signal VLSI for weight modification incontrastive divergence learning. Lec-ture Notes in Computer Science, 2415:426–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150426.htm; http:/


series/0558/papers/2415/24150426.

pdf.

Weng:2002:DDG

[1638] Sebastian Weng and Jochen J. Steil.Data driven generation of interac-tions for feature binding and re-laxation labeling. Lecture Notes



bibs/2415/24150432.htm; http:/


series/0558/papers/2415/24150432.

pdf.

Bote-Lorenzo:2002:HTS

[1639] Miguel L. Bote-Lorenzo, Yannis A.Dimitriadis, and Eduardo Gomez-Sanchez. A hybrid two-stagefuzzy ARTMAP and LVQ neuro-fuzzy system for on-line handwrit-ing recognition. Lecture Notesin Computer Science, 2415:438–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150438.htm; http:/


series/0558/papers/2415/24150438.

pdf.

Ferrari-Trecate:2002:NLM

[1640] Giancarlo Ferrari-Trecate and MarcoMuselli. A new learning method forpiecewise linear regression. LectureNotes in Computer Science, 2415:444–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150444.htm; http:/


series/0558/papers/2415/24150444.

pdf.

Graepel:2002:SAM

[1641] Thore Graepel and Nicol N. Schrau-

REFERENCES 308

dolph. Stable adaptive momen-tum for rapid online learning innonlinear systems. Lecture Notesin Computer Science, 2415:450–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150450.htm; http:/


series/0558/papers/2415/24150450.

pdf.

Erdogmus:2002:PEP

[1642] Deniz Erdogmus, Jose C. Principe,Luis Vielva, and David Luengo.Potential energy and particle in-teraction approach for learning inadaptive systems. Lecture Notesin Computer Science, 2415:456–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150456.htm; http:/


series/0558/papers/2415/24150456.

pdf.

Preciado:2002:PLA

[1643] Vıctor M. Preciado. Piecewise-linear approximation of any smoothoutput function on the cellularneural network. Lecture Notesin Computer Science, 2415:462–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150462.htm; http:/


series/0558/papers/2415/24150462.

pdf.

Anguita:2002:MBM

[1644] Davide Anguita and Matteo Gagli-olo. MDL based model selection forrelevance vector regression. LectureNotes in Computer Science, 2415:468–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150468.htm; http:/


series/0558/papers/2415/24150468.

pdf.

Koppen:2002:TKN

[1645] Mario Koppen. On the trainingof a Kolmogorov network. LectureNotes in Computer Science, 2415:474–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150474.htm; http:/


series/0558/papers/2415/24150474.

pdf.

Kwak:2002:NMF

[1646] Nojun Kwak and Chong-Ho Choi.A new method of feature extrac-tion and its stability. Lecture Notesin Computer Science, 2415:480–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150480.htm; http:/


series/0558/papers/2415/24150480.

pdf.

REFERENCES 309

Benabdeslem:2002:VAW

[1647] Khalid Benabdeslem, Younes Bennani,and Eric Janvier. Visualization andanalysis of Web navigation data. Lec-ture Notes in Computer Science, 2415:486–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150486.htm; http:/


series/0558/papers/2415/24150486.

pdf.

Oba:2002:MVE

[1648] Shigeyuki Oba, Masa aki Sato, IchiroTakemasa, Morito Monden, Ken ichiMatsubara, and Shin Ishii. Miss-ing value estimation using mix-ture of PCAs. Lecture Notesin Computer Science, 2415:492–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150492.htm; http:/


series/0558/papers/2415/24150492.

pdf.

Svensson:2002:HPM

[1649] Jakob Svensson, Manfred von Heller-mann, and Ralf Konig. High preci-sion measurement of fuel density pro-files in nuclear fusion plasmas. Lec-ture Notes in Computer Science, 2415:498–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150498.htm; http:/


series/0558/papers/2415/24150498.

pdf.

Grabczewski:2002:HFD

[1650] Krzysztof Grabczewski and Wlodzis-law Duch. Heterogeneous forestsof decision trees. Lecture Notesin Computer Science, 2415:504–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150504.htm; http:/


series/0558/papers/2415/24150504.

pdf.

Bounkong:2002:ICA

[1651] Stephane Bounkong, David Saad, andDavid Lowe. Independent compo-nent analysis for domain indepen-dent watermarking. Lecture Notesin Computer Science, 2415:510–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150510.htm; http:/


series/0558/papers/2415/24150510.

pdf.

Ragg:2002:AML

[1652] Thomas Ragg, Frank Padberg, andRalf Schoknecht. Applying machinelearning to solve an estimation prob-lem in software inspections. LectureNotes in Computer Science, 2415:516–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150516.htm; http:/

REFERENCES 310


series/0558/papers/2415/24150516.

pdf.

Yoshioka:2002:CGE

[1653] Taku Yoshioka, Ryouko Morioka,Kazuo Kobayashi, Shigeyuki Oba, Nao-take Ogawsawara, and Shin Ishii. Clus-tering of gene expression data bymixture of PCA models. LectureNotes in Computer Science, 2415:522–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150522.htm; http:/


series/0558/papers/2415/24150522.

pdf.

Sugiyama:2002:SRP

[1654] Masashi Sugiyama and Klaus-RobertMuller. Selecting ridge param-eters in infinite dimensional hy-pothesis spaces. Lecture Notesin Computer Science, 2415:528–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150528.htm; http:/


series/0558/papers/2415/24150528.

pdf.

Kanamori:2002:NSA

[1655] Takafumi Kanamori. A new sequen-tial algorithm for regression problemsby using mixture distribution. LectureNotes in Computer Science, 2415:535–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150535.htm; http:/


series/0558/papers/2415/24150535.

pdf.

Lopez:2002:NBC

[1656] Damian Lopez and Marıa Jose Cas-tro. Neural-based classification ofblocks from documents. Lecture Notesin Computer Science, 2415:541–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150541.htm; http:/


series/0558/papers/2415/24150541.

pdf.

Salcedo-Sanz:2002:FSG

[1657] Sancho Salcedo-Sanz, Mario Prado-Cumplido, Fernando Perez-Cruz, andCarlos Bousono-Calzon. Feature selec-tion via genetic optimization. LectureNotes in Computer Science, 2415:547–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150547.htm; http:/


series/0558/papers/2415/24150547.

pdf.

Gonzalez:2002:NNC

[1658] Jesus Gonzalez, Ignacio Rojas, andHector Pomares. Neural networks,clustering techniques, and function ap-proximation problems. Lecture Notesin Computer Science, 2415:553–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 311



bibs/2415/24150553.htm; http:/


series/0558/papers/2415/24150553.

pdf.

Gonzalez:2002:ETN

[1659] Jesus Gonzalez, Ignacio Rojas, Hec-tor Pomares, Alberto Prieto, andK. Goser. Evolutionary trainingof neuro-fuzzy patches for func-tion approximation. Lecture Notesin Computer Science, 2415:559–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150559.htm; http:/


series/0558/papers/2415/24150559.

pdf.

Martinez:2002:URN

[1660] Cesar Martınez, Alfons Juan, andFrancisco Casacuberta. Using recur-rent neural networks for automaticchromosome classification. LectureNotes in Computer Science, 2415:565–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150565.htm; http:/


series/0558/papers/2415/24150565.

pdf.

Dimitriadou:2002:MEA

[1661] Evgenia Dimitriadou, Andreas Weinges-sel, and Kurt Hornik. A mixedensemble approach for the semi-supervised problem. Lecture Notes



bibs/2415/24150571.htm; http:/


series/0558/papers/2415/24150571.

pdf.

Mateos:2002:UPS

[1662] Alvaro Mateos, Javier Herrero, andJoaquın Dopazo. Using perceptrons forsupervised classification of DNA mi-croarray samples: Obtaining the op-timal level of information and findingdifferentially expressed genes. LectureNotes in Computer Science, 2415:577–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150577.htm; http:/


series/0558/papers/2415/24150577.

pdf.

Gavin:2002:LBT

[1663] Gerald Gavin and Olivier Tey-taud. Lower bounds for trainingand leave-one-out estimates of thegeneralization error. Lecture Notesin Computer Science, 2415:583–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150583.htm; http:/


series/0558/papers/2415/24150583.

pdf.

REFERENCES 312

Salmeron:2002:SSQ

[1664] Moises Salmeron, Julio Ortega, Car-los Garcıa Puntonet, Alberto Prieto,and Ignacio Rojas. SSA, SVD, QR-cp, and RBF model reduction. Lec-ture Notes in Computer Science, 2415:589–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150589.htm; http:/


series/0558/papers/2415/24150589.

pdf.

Leisink:2002:LAB

[1665] Martijn A. R. Leisink, Hilbert J. Kap-pen, and Han G. Brunner. Linkageanalysis: A Bayesian approach. Lec-ture Notes in Computer Science, 2415:595–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150595.htm; http:/


series/0558/papers/2415/24150595.

pdf.

Sperduti:2002:LSS

[1666] Alessandro Sperduti. On linear separa-bility of sequences and structures. Lec-ture Notes in Computer Science, 2415:601–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150601.htm; http:/


series/0558/papers/2415/24150601.

pdf.

Roth:2002:SBM

[1667] Volker Roth, Mikio L. Braun, TilmanLange, and Joachim M. Buhmann.Stability-based model order selectionin clustering with applications togene expression data. Lecture Notesin Computer Science, 2415:607–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150607.htm; http:/


series/0558/papers/2415/24150607.

pdf.

Zufiria:2002:EBR

[1668] Pedro J. Zufiria and Carlos Rivero.EM-based radial basis function train-ing with partial information. LectureNotes in Computer Science, 2415:613–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150613.htm; http:/


series/0558/papers/2415/24150613.

pdf.

Giudici:2002:SSL

[1669] Matteo Giudici, Filippo Queirolo, andMaurizio Valle. Stochastic supervisedlearning algorithms with local andadaptive learning rate for recognis-ing hand-written characters. LectureNotes in Computer Science, 2415:619–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150619.htm; http:/


REFERENCES 313

series/0558/papers/2415/24150619.

pdf.

Sierra:2002:IOF

[1670] Alejandro Sierra and Fernando Corba-cho. Input and output feature selection.Lecture Notes in Computer Science,2415:625–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24150625.htm; http:


series/0558/papers/2415/24150625.

pdf.

Lago-Fernandez:2002:OEH

[1671] Luis F. Lago-Fernandez and Fer-nando Corbacho. Optimal extrac-tion of hidden causes. Lecture Notesin Computer Science, 2415:631–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150631.htm; http:/


series/0558/papers/2415/24150631.

pdf.

Sanchez-Montanes:2002:TNI

[1672] Manuel A. Sanchez-Montanes and Fer-nando J. Corbacho. Towards a newinformation processing measure forneural computation. Lecture Notesin Computer Science, 2415:637–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150637.htm; http:/


series/0558/papers/2415/24150637.

pdf.

Stensmo:2002:SEP

[1673] Magnus Stensmo. A scalable andefficient probabilistic information re-trieval and text mining system. Lec-ture Notes in Computer Science, 2415:643–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150643.htm; http:/


series/0558/papers/2415/24150643.

pdf.

MacDonald:2002:MML

[1674] Donald MacDonald, Emilio Cor-chado, Colin Fyfe, and ErzsebetMerenyi. Maximum and minimumlikelihood Hebbian learning for ex-ploratory projection pursuit. LectureNotes in Computer Science, 2415:649–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150649.htm; http:/


series/0558/papers/2415/24150649.

pdf.

Gers:2002:LCS

[1675] Felix A. Gers, Juan Antonio Perez-Ortiz, Douglas Eck, and JurgenSchmidhuber. Learning context sen-sitive languages with LSTM trainedwith Kalman filters. Lecture Notesin Computer Science, 2415:655–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 314


bibs/2415/24150655.htm; http:/


series/0558/papers/2415/24150655.

pdf.

Yoshimoto:2002:HMS

[1676] Junichiro Yoshimoto, Shin Ishii, andMasa aki Sato. Hierarchical modelselection for NGnet based on varia-tional Bayes inference. Lecture Notesin Computer Science, 2415:661–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150661.htm; http:/


series/0558/papers/2415/24150661.

pdf.

Conan-Guez:2002:MLP

[1677] Brieuc Conan-Guez and Fabrice Rossi.Multi-layer perceptrons for func-tional data analysis: A projec-tion based approach. Lecture Notesin Computer Science, 2415:667–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150667.htm; http:/


series/0558/papers/2415/24150667.

pdf.

Dorronsoro:2002:NGM

[1678] Jose R. Dorronsoro and Ana Gonzalez.Natural gradient and multiclassNLDA networks. Lecture Notesin Computer Science, 2415:673–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2415/24150673.htm; http:/


series/0558/papers/2415/24150673.

pdf.

Cawley:2002:GTA

[1679] Gavin C. Cawley and Nicola L. C.Talbot. A greedy training algo-rithm for sparse least-squares sup-port vector machines. Lecture Notesin Computer Science, 2415:681–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150681.htm; http:/


series/0558/papers/2415/24150681.

pdf.

Cherkassky:2002:SMP

[1680] Vladimir Cherkassky and YunqianMa. Selection of meta-parameters forsupport vector regression. LectureNotes in Computer Science, 2415:687–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150687.htm; http:/


series/0558/papers/2415/24150687.

pdf.

Graepel:2002:KMC

[1681] Thore Graepel. Kernel matrix comple-tion by semidefinite programming. Lec-ture Notes in Computer Science, 2415:694–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-

REFERENCES 315


bibs/2415/24150694.htm; http:/


series/0558/papers/2415/24150694.

pdf.

Sato:2002:ISK

[1682] Masa aki Sato and Shigeyuki Oba. In-cremental sparse kernel machine. Lec-ture Notes in Computer Science, 2415:700–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150700.htm; http:/


series/0558/papers/2415/24150700.

pdf.

Rakotomamonjy:2002:FKL

[1683] Alain Rakotomamonjy and StephaneCanu. Frame kernels for learning. Lec-ture Notes in Computer Science, 2415:707–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150707.htm; http:/


series/0558/papers/2415/24150707.

pdf.

Brabanter:2002:RCV

[1684] Jos De Brabanter, Kristiaan Pelck-mans, Johan A. K. Suykens, andJoos Vandewalle. Robust cross-validation score function for non-linearfunction estimation. Lecture Notesin Computer Science, 2415:713–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150713.htm; http:/


series/0558/papers/2415/24150713.

pdf.

Hamers:2002:CSR

[1685] Bart Hamers, Johan A. K. Suykens,and Bart De Moor. Compactlysupported RBF kernels for sparsi-fying the gram matrix in LS-SVMregression models. Lecture Notesin Computer Science, 2415:720–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150720.htm; http:/


series/0558/papers/2415/24150720.

pdf.

Tsuda:2002:LOK

[1686] Koji Tsuda and Motoaki Kawanabe.The leave-one-out kernel. LectureNotes in Computer Science, 2415:727–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150727.htm; http:/


series/0558/papers/2415/24150727.

pdf.

Borer:2002:SVR

[1687] Silvio Borer and Wulfram Gerst-ner. Support vector representationof multi-categorical data. LectureNotes in Computer Science, 2415:733–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 316

bibs/2415/24150733.htm; http:/


series/0558/papers/2415/24150733.

pdf.

Takahashi:2002:RNK

[1688] Takashi Takahashi and Takio Kurita.Robust de-noising by kernel PCA. Lec-ture Notes in Computer Science, 2415:739–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150739.htm; http:/


series/0558/papers/2415/24150739.

pdf.

Meinicke:2002:MCC

[1689] Peter Meinicke, Thorsten Twell-mann, and Helge Ritter. Maximumcontrast classifiers. Lecture Notesin Computer Science, 2415:745–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150745.htm; http:/


series/0558/papers/2415/24150745.

pdf.

Perez-Cruz:2002:PMC

[1690] Fernando Perez-Cruz and AntonioArtes-Rodrıguez. Puncturing multi-class support vector machines. LectureNotes in Computer Science, 2415:751–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150751.htm; http:/


series/0558/papers/2415/24150751.

pdf.

Perez-Cruz:2002:MDF

[1691] Fernando Perez-Cruz, Gustavo Camps-Valls, Emilio Soria-Olivas, Juan JosePerez-Ruixo, Anıbal R. Figueiras-Vidal, and Antonio Artes-Rodrıguez.Multi-dimensional function approxima-tion and regression estimation. LectureNotes in Computer Science, 2415:757–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150757.htm; http:/


series/0558/papers/2415/24150757.

pdf.

Moguerza:2002:DNC

[1692] Javier M. Moguerza, Alberto Munoz,and Manuel Martın-Merino. Detect-ing the number of clusters using a sup-port vector machine approach. LectureNotes in Computer Science, 2415:763–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150763.htm; http:/


series/0558/papers/2415/24150763.

pdf.

Siolas:2002:MPP

[1693] George Siolas and Florence d’AlcheBuc. Mixtures of probabilistic PCAsand Fisher kernels for word anddocument modeling. Lecture Notesin Computer Science, 2415:769–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 317



bibs/2415/24150769.htm; http:/


series/0558/papers/2415/24150769.

pdf.

Sato:2002:RLB

[1694] Masa aki Sato, Yutaka Nakamura,and Shin Ishii. Reinforcement learn-ing for biped locomotion. LectureNotes in Computer Science, 2415:777–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150777.htm; http:/


series/0558/papers/2415/24150777.

pdf.

Hulse:2002:DNS

[1695] Martin Hulse and Frank Pasemann.Dynamical neural schmitt triggerfor robot control. Lecture Notesin Computer Science, 2415:783–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150783.htm; http:/


series/0558/papers/2415/24150783.

pdf.

McMinn:2002:EAN

[1696] David McMinn, Grant Maxwell, andChristopher MacLeod. Evolution-ary artificial neural networks forquadruped locomotion. Lecture Notesin Computer Science, 2415:789–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2415/24150789.htm; http:/


series/0558/papers/2415/24150789.

pdf.

Conradt:2002:SMO

[1697] Jorg Conradt, Pascal Simon, MichelPescatore, and Paul F. M. J. Ver-schure. Saliency maps operatingon stereo images detect landmarksand their distance. Lecture Notesin Computer Science, 2415:795–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150795.htm; http:/


series/0558/papers/2415/24150795.

pdf.

Herzallah:2002:NAM

[1698] Randa Herzallah and David Lowe.A novel approach to modelling andexploiting uncertainty in stochas-tic control systems. Lecture Notesin Computer Science, 2415:801–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150801.htm; http:/


series/0558/papers/2415/24150801.

pdf.

Haber:2002:TWP

[1699] Rodolfo E. Haber, A. Alique, andJ. R. Alique. Tool wear prediction inmilling using neural networks. LectureNotes in Computer Science, 2415:807–

REFERENCES 318



bibs/2415/24150807.htm; http:/


series/0558/papers/2415/24150807.

pdf.

Schoknecht:2002:SRL

[1700] Ralf Schoknecht and Martin Ried-miller. Speeding-up reinforcementlearning with multi-step actions. Lec-ture Notes in Computer Science, 2415:813–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150813.htm; http:/


series/0558/papers/2415/24150813.

pdf.

Todorovic:2002:EKF

[1701] Branimir Todorovic, Miomir Stankovic,and Claudio Moraga. ExtendedKalman filter trained recurrent ra-dial basis function network in non-linear system identification. LectureNotes in Computer Science, 2415:819–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150819.htm; http:/


series/0558/papers/2415/24150819.

pdf.

Hubner:2002:IMP

[1702] Wolfgang Hubner and Hanspeter A.Mallot. Integration of metric place re-lations in a landmark graph. Lecture



bibs/2415/24150825.htm; http:/


series/0558/papers/2415/24150825.

pdf.

Simon:2002:HOC

[1703] Steffen Simon, Friedhelm Schwenker,Hans A. Kestler, Gerhard Kraet-zschmar, and Gunther Palm. Hier-archical object classification for au-tonomous mobile robots. LectureNotes in Computer Science, 2415:831–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150831.htm; http:/


series/0558/papers/2415/24150831.

pdf.

Becerra:2002:SPG

[1704] J. A. Becerra, R. J. Duro, and J. San-tos. Self pruning Gaussian synapse net-works for behavior based robots. Lec-ture Notes in Computer Science, 2415:837–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150837.htm; http:/


series/0558/papers/2415/24150837.

pdf.

Benzaquen:2002:SOC

[1705] Samuel Benzaquen and CarolinaChang. Second-order conditioning

REFERENCES 319

in mobile robots. Lecture Notesin Computer Science, 2415:844–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150844.htm; http:/


series/0558/papers/2415/24150844.

pdf.

Lichtensteiger:2002:OSM

[1706] Lukas Lichtensteiger and Rolf Pfeifer.An optimal sensor morphology im-proves adaptability of neural net-work controllers. Lecture Notesin Computer Science, 2415:850–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150850.htm; http:/


series/0558/papers/2415/24150850.

pdf.

Angulo:2002:LIK

[1707] Vicente Ruiz de Angulo and CarmeTorras. Learning inverse kinematicsvia cross-point function decomposition.Lecture Notes in Computer Science,2415:856–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24150856.htm; http:


series/0558/papers/2415/24150856.

pdf.

Lopez-Rubio:2002:PCA

[1708] Ezequiel Lopez-Rubio, Jose Munoz-Perez, and Jose Antonio Gomez-Ruiz.

The principal components analysisself-organizing map. Lecture Notesin Computer Science, 2415:865–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150865.htm; http:/


series/0558/papers/2415/24150865.

pdf.

Pampalk:2002:USD

[1709] Elias Pampalk, Andreas Rauber, andDieter Merkl. Using smoothed datahistograms for cluster visualization inself-organizing maps. Lecture Notesin Computer Science, 2415:871–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150871.htm; http:/


series/0558/papers/2415/24150871.

pdf.

Hammer:2002:RES

[1710] Barbara Hammer, Andreas Rechtien,Marc Strickert, and Thomas Vill-mann. Rule extraction from self-organizing networks. Lecture Notesin Computer Science, 2415:877–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150877.htm; http:/


series/0558/papers/2415/24150877.

pdf.

REFERENCES 320

Hirose:2002:PSO

[1711] Akira Hirose and Tomoyuki Na-gashima. Predictive self-organizingmap for vector quantization of mi-gratory signals. Lecture Notesin Computer Science, 2415:884–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150884.htm; http:/


series/0558/papers/2415/24150884.

pdf.

Lebbah:2002:CTM

[1712] Mustapha Lebbah, Christian Cha-banon, Fouad Badran, and SylvieThiria. Categorical topological map.Lecture Notes in Computer Science,2415:890–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24150890.htm; http:


series/0558/papers/2415/24150890.

pdf.

Panchev:2002:STD

[1713] Christo Panchev, Stefan Wermter, andHuixin Chen. Spike-timing dependentcompetitive learning of integrate-and-fire neurons with active dendrites. Lec-ture Notes in Computer Science, 2415:896–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150896.htm; http:/


series/0558/papers/2415/24150896.

pdf.

Saalbach:2002:PSO

[1714] Axel Saalbach, Gunther Heidemann,and Helge Ritter. ParametrizedSOMs for object recognition andpose estimation. Lecture Notesin Computer Science, 2415:902–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150902.htm; http:/


series/0558/papers/2415/24150902.

pdf.

Plebe:2002:ETS

[1715] Alessio Plebe. An effective travel-ing salesman problem solver based onself-organizing map. Lecture Notesin Computer Science, 2415:908–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150908.htm; http:/


series/0558/papers/2415/24150908.

pdf.

Verbeek:2002:CPC

[1716] Jakob J. Verbeek, Nikos Vlassis, andBen Krose. Coordinating principalcomponent analyzers. Lecture Notesin Computer Science, 2415:914–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150914.htm; http:/


series/0558/papers/2415/24150914.

pdf.

REFERENCES 321

Viviani:2002:LIS

[1717] Roberto Viviani. Lateral interac-tions in self-organizing maps. LectureNotes in Computer Science, 2415:920–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150920.htm; http:/


series/0558/papers/2415/24150920.

pdf.

Lensu:2002:CSS

[1718] Anssi Lensu and Pasi Koikkalainen.Complexity selection of the self-organizing map. Lecture Notesin Computer Science, 2415:927–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150927.htm; http:/


series/0558/papers/2415/24150927.

pdf.

Lee:2002:NPI

[1719] John A. Lee and Michel Verley-sen. Nonlinear projection withthe isotop method. Lecture Notesin Computer Science, 2415:933–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150933.htm; http:/


series/0558/papers/2415/24150933.

pdf.

Claussen:2002:ALD

[1720] Jens Christian Claussen and Heinz GeorgSchuster. Asymptotic level densityof the elastic net self-organizing fea-ture map. Lecture Notes in ComputerScience, 2415:939–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2415/24150939.



2415/24150939.pdf.

Fontenla-Romero:2002:LMU

[1721] Oscar Fontenla-Romero, AmparoAlonso-Betanzos, Enrique Castillo,Jose C. Principe, and Bertha Guijarro-Berdinas. Local modeling usingself-organizing maps and single layerneural networks. Lecture Notesin Computer Science, 2415:945–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150945.htm; http:/


series/0558/papers/2415/24150945.

pdf.

Vesanto:2002:DMB

[1722] Juha Vesanto and Mika Sulkava. Dis-tance matrix based clustering of theself-organizing map. Lecture Notesin Computer Science, 2415:951–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150951.htm; http:/


REFERENCES 322

series/0558/papers/2415/24150951.

pdf.

Vogiatzis:2002:MGN

[1723] Dimitrios Vogiatzis and Andreas Stafy-lopatis. Mapping the growing neu-ral gas to situation calculus. LectureNotes in Computer Science, 2415:957–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150957.htm; http:/


series/0558/papers/2415/24150957.

pdf.

Chiarantoni:2002:RUC

[1724] Ernesto Chiarantoni, Giuseppe Ac-ciani, Girolamo Fornarelli, and Sil-vano Vergura. Robust unsupervisedcompetitive neural network by localcompetitive signals. Lecture Notesin Computer Science, 2415:963–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150963.htm; http:/


series/0558/papers/2415/24150963.

pdf.

Panangadan:2002:GSC

[1725] Anand Panangadan and Michael G.Dyer. Goal sequencing for constructionagents in a simulated environment. Lec-ture Notes in Computer Science, 2415:969–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150969.htm; http:/


series/0558/papers/2415/24150969.

pdf.

Barreto:2002:NMD

[1726] Guilherme de A. Barreto and AluizioF. R. Araujo. Nonlinear model-ing of dynamic systems with theself-organizing map. Lecture Notesin Computer Science, 2415:975–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150975.htm; http:/


series/0558/papers/2415/24150975.

pdf.

Koskela:2002:IRF

[1727] Markus Koskela, Jorma Laaksonen,and Erkki Oja. Implementing relevancefeedback as convolutions of local neigh-borhoods on self-organizing maps. Lec-ture Notes in Computer Science, 2415:981–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150981.htm; http:/


series/0558/papers/2415/24150981.

pdf.

Hunter:2002:PSO

[1728] Andrew Hunter and Richard LeeKennedy. A Pareto self-organizingmap. Lecture Notes in Computer Sci-ence, 2415:987–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2415/24150987.

REFERENCES 323



2415/24150987.pdf.

Georgakis:2002:SVB

[1729] Apostolos Georgakis, Costas Kotropou-los, and Ioannis Pitas. A SOM variantbased on the Wilcoxon test for docu-ment organization and retrieval. Lec-ture Notes in Computer Science, 2415:993–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150993.htm; http:/


series/0558/papers/2415/24150993.

pdf.

Peltonen:2002:LMA

[1730] Jaakko Peltonen, Arto Klami, andSamuel Kaski. Learning more accuratemetrics for self-organizing maps. Lec-ture Notes in Computer Science, 2415:999–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24150999.htm; http:/


series/0558/papers/2415/24150999.

pdf.

Blanco:2002:CVH

[1731] Ignacio Dıaz Blanco, Abel A. CuadradoVega, and Alberto B. Diez Gonzalez.Correlation visualization of high di-mensional data using topographicmaps. Lecture Notes in Computer Sci-ence, 2415:1005–??, 2002. CODENLNCSD9. ISSN 0302-9743 (print),1611-3349 (electronic). URL http://


series/0558/bibs/2415/24151005.



2415/24151005.pdf.

Flexer:2002:CUS

[1732] Arthur Flexer, Georg Gruber, andGeorg Dorffner. Continuous unsu-pervised sleep staging based on asingle EEG signal. Lecture Notesin Computer Science, 2415:1013–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151013.htm; http:/


series/0558/papers/2415/24151013.

pdf.

Chiu:2002:FAB

[1733] Kai Chun Chiu and Lei Xu. Finan-cial APT-based Gaussian TFA learn-ing for adaptive portfolio management.Lecture Notes in Computer Science,2415:1019–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24151019.htm; http:


series/0558/papers/2415/24151019.

pdf.

Liu:2002:CIF

[1734] Zhiyong Liu and Lei Xu. On conver-gence of an iterative factor estimate al-gorithm for the NFA model. LectureNotes in Computer Science, 2415:1025–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


REFERENCES 324

bibs/2415/24151025.htm; http:/


series/0558/papers/2415/24151025.

pdf.

Foxall:2002:EFP

[1735] Robert J. Foxall, Gavin C. Cawley,Stephen R. Dorling, and Danilo P.Mandic. Error functions for predictionof episodes of poor air quality. LectureNotes in Computer Science, 2415:1031–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151031.htm; http:/


series/0558/papers/2415/24151031.

pdf.

Sanz-Gonzalez:2002:AIS

[1736] Jose L. Sanz-Gonzalez and FranciscoAlvarez-Vaquero. Adaptive impor-tance sampling technique for neu-ral detector training. Lecture Notesin Computer Science, 2415:1037–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151037.htm; http:/


series/0558/papers/2415/24151037.

pdf.

Lint:2002:SSN

[1737] Hans van Lint, Serge P. Hoogen-doorn, and Henk J. van Zuylen.State space neural networks for free-way travel time prediction. LectureNotes in Computer Science, 2415:1043–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-



bibs/2415/24151043.htm; http:/


series/0558/papers/2415/24151043.

pdf.

Theis:2002:OIG

[1738] Fabian J. Theis, Elmar W. Lang, To-bias Westenhuber, and Carlos G. Pun-tonet. Overcomplete ICA with ageometric algorithm. Lecture Notesin Computer Science, 2415:1049–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151049.htm; http:/


series/0558/papers/2415/24151049.

pdf.

Perez-Ortiz:2002:ILT

[1739] Juan A. Perez-Ortiz, Jurgen Schmid-huber, Felix A. Gers, and Dou-glas Eck. Improving long-term on-line prediction with decoupled ex-tended Kalman filters. Lecture Notesin Computer Science, 2415:1055–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151055.htm; http:/


series/0558/papers/2415/24151055.

pdf.

Zimmermann:2002:MMB

[1740] Georg Zimmermann, Ralph Groth-mann, Christoph Tietz, and RalphNeuneier. Market modeling basedon cognitive agents. Lecture Notes

REFERENCES 325



bibs/2415/24151061.htm; http:/


series/0558/papers/2415/24151061.

pdf.

Kurimo:2002:EFL

[1741] Mikko Kurimo and Krista Lagus.An efficiently focusing large vocabu-lary language model. Lecture Notesin Computer Science, 2415:1068–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151068.htm; http:/


series/0558/papers/2415/24151068.

pdf.

Teranishi:2002:NCB

[1742] Masaru Teranishi, Sigeru Omatu, andToshihisa Kosaka. Neuro-classificationof bill fatigue levels based on acous-tic wavelet components. Lecture Notesin Computer Science, 2415:1074–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151074.htm; http:/


series/0558/papers/2415/24151074.

pdf.

Allende:2002:REL

[1743] Hector Allende, Claudio Moraga, andRodrigo Salas. Robust estimator forthe learning process in neural net-

works applied in time series. LectureNotes in Computer Science, 2415:1080–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151080.htm; http:/


series/0558/papers/2415/24151080.

pdf.

Blaschke:2002:ICB

[1744] Tobias Blaschke and Laurenz Wiskott.An improved cumulant based methodfor independent component analysis.Lecture Notes in Computer Science,2415:1087–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24151087.htm; http:


series/0558/papers/2415/24151087.

pdf.

Kindermann:2002:FOC

[1745] Lars Kindermann, Achim Lewandowski,and Peter Protzel. Finding the op-timal continuous model for discretedata by neural network interpola-tion of fractional iteration. LectureNotes in Computer Science, 2415:1094–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151094.htm; http:/


series/0558/papers/2415/24151094.

pdf.

Rojo-Alvarez:2002:SVR

[1746] Jose Luis Rojo-Alvarez, Arcadi Garcıa-

REFERENCES 326

Alberola, Manel Martınez-Ramon,Mariano Valdes, Anıbal R. Figueiras-Vidal, and Antonio Artes-Rodrıguez.Support vector robust algorithms fornon-parametric spectral analysis. Lec-ture Notes in Computer Science, 2415:1100–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24151100.htm; http:


series/0558/papers/2415/24151100.

pdf.

Rojo-Alvarez:2002:SVM

[1747] Jose Luis Rojo-Alvarez, Manel Martınez-Ramon, Anıbal R. Figueiras-Vidal,Mario de Prado-Cumplido, and An-tonio Artes-Rodrıguez. Supportvector method for ARMA systemidentification: A robust cost in-terpretation. Lecture Notes inComputer Science, 2415:1106–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151106.htm; http:/


series/0558/papers/2415/24151106.

pdf.

Basalyga:2002:DIH

[1748] Gleb Basalyga and Magnus Rat-tray. Dynamics of ICA for high-dimensional data. Lecture Notesin Computer Science, 2415:1112–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151112.htm; http:/


series/0558/papers/2415/24151112.

pdf.

Boscolo:2002:BCI

[1749] Riccardo Boscolo, Hong Pan, andVwani P. Roychowdhury. BeyondComon’s identifiability theorem for in-dependent component analysis. LectureNotes in Computer Science, 2415:1119–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151119.htm; http:/


series/0558/papers/2415/24151119.

pdf.

Hauser:2002:TPB

[1750] Alexandre Hauser, Pierre-Edouard Sot-tas, and Jose del R. Millan. Tempo-ral processing of brain activity for therecognition of EEG patterns. LectureNotes in Computer Science, 2415:1125–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151125.htm; http:/


series/0558/papers/2415/24151125.

pdf.

Andreou:2002:CAO

[1751] Panayiotis Ch. Andreou, Chris Char-alambous, and Spiros H. Mart-zoukos. Critical assessment of op-tion pricing methods using artifi-cial neural networks. Lecture Notesin Computer Science, 2415:1131–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-

REFERENCES 327



bibs/2415/24151131.htm; http:/


series/0558/papers/2415/24151131.

pdf.

Blankertz:2002:STD

[1752] Benjamin Blankertz, Christin Schafer,Guido Dornhege, and Gabriel Cu-rio. Single trial detection of EEGerror potentials: A tool for increas-ing BCI transmission rates. LectureNotes in Computer Science, 2415:1137–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151137.htm; http:/


series/0558/papers/2415/24151137.

pdf.

Sottas:2002:DNA

[1753] Pierre-Edouard Sottas and WulframGerstner. Dynamic noise annealingfor learning temporal sequences withrecurrent neural networks. LectureNotes in Computer Science, 2415:1144–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151144.htm; http:/


series/0558/papers/2415/24151144.

pdf.

Lopez-Risueno:2002:CNN

[1754] Gustavo Lopez-Risueno, Jesus Gra-jal, Simon Haykin, and Rosa Dıaz-Oliver. Convolutional neural net-works for radar detection. Lecture



bibs/2415/24151150.htm; http:/


series/0558/papers/2415/24151150.

pdf.

Kohlmorgen:2002:SGM

[1755] Jens Kohlmorgen and BenjaminBlankertz. A simple generative modelfor single-trial EEG classification. Lec-ture Notes in Computer Science, 2415:1156–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24151156.htm; http:


series/0558/papers/2415/24151156.

pdf.

Georgiev:2002:RBS

[1756] Pando Georgiev and Andrzej Ci-chocki. Robust blind source sep-aration utilizing second and fourthorder statistics. Lecture Notesin Computer Science, 2415:1162–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151162.htm; http:/


series/0558/papers/2415/24151162.

pdf.

Choi:2002:ADD

[1757] Seungjin Choi. Adaptive differen-tial decorrelation: A natural gra-dient algorithm. Lecture Notes

REFERENCES 328



bibs/2415/24151168.htm; http:/


series/0558/papers/2415/24151168.

pdf.

Pelaez-Moreno:2002:ASL

[1758] Carmen Pelaez-Moreno, Emilio Parrado-Hernandez, Ascension Gallardo-Antolın,Adrian Zambrano-Miranda, and Fer-nando Dıaz de Marıa. An applica-tion of SVM to lost packets reconstruc-tion in voice-enabled services. LectureNotes in Computer Science, 2415:1174–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151174.htm; http:/


series/0558/papers/2415/24151174.

pdf.

Otterpohl:2002:BWL

[1759] Jens R. Otterpohl. Baum-Welch learn-ing in discrete hidden Markov modelswith linear factorial constraints. Lec-ture Notes in Computer Science, 2415:1180–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24151180.htm; http:


series/0558/papers/2415/24151180.

pdf.

Suarez:2002:MAM

[1760] Alberto Suarez. Mixtures of au-

toregressive models for financialrisk analysis. Lecture Notes inComputer Science, 2415:1186–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151186.htm; http:/


series/0558/papers/2415/24151186.

pdf.

Barla:2002:KBO

[1761] Annalisa Barla and Francesca Odone.Kernel-based 3D object representation.Lecture Notes in Computer Science,2415:1195–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24151195.htm; http:


series/0558/papers/2415/24151195.

pdf.

Ghennam:2002:MSA

[1762] Souheila Ghennam and Khier Ben-mahammed. Multiresolution supportfor adaptive image restoration us-ing neural networks. Lecture Notesin Computer Science, 2415:1201–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151201.htm; http:/


series/0558/papers/2415/24151201.

pdf.

Seguier:2002:AVS

[1763] Renaud Seguier and David Mercier.Audio-visual speech recognition one

REFERENCES 329

pass learning with spiking neurons.Lecture Notes in Computer Science,2415:1207–??, 2002. CODEN LNCSD9.ISSN 0302-9743 (print), 1611-3349(electronic). URL http://link.


0558/bibs/2415/24151207.htm; http:


series/0558/papers/2415/24151207.

pdf.

Turiel:2002:AIR

[1764] Antonio Turiel, Jean-Pierre Nadal,and Nestor Parga. An algorithmfor image representation as indepen-dent levels of resolution. LectureNotes in Computer Science, 2415:1213–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151213.htm; http:/


series/0558/papers/2415/24151213.

pdf.

Gastaldo:2002:CBP

[1765] Paolo Gastaldo, Rodolfo Zunino, IngridHeynderickx, and Elena Vicario. Circu-lar back-propagation networks for mea-suring displayed image quality. LectureNotes in Computer Science, 2415:1219–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151219.htm; http:/


series/0558/papers/2415/24151219.

pdf.

Wersing:2002:ULC

[1766] Heiko Wersing and Edgar Korner.

Unsupervised learning of combina-tion features for hierarchical recog-nition models. Lecture Notes inComputer Science, 2415:1225–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151225.htm; http:/


series/0558/papers/2415/24151225.

pdf.

Aizenberg:2002:TBB

[1767] Igor Aizenberg, Taras Bregin, Con-stantine Butakoff, Victor Karnaukhov,Nickolay Merzlyakov, and Olga Milukova.Type of blur and blur parame-ters identification using neural net-work and its application to im-age restoration. Lecture Notesin Computer Science, 2415:1231–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151231.htm; http:/


series/0558/papers/2415/24151231.

pdf.

Backer:2002:UNF

[1768] Gerriet Backer and Barbel Mertsching.Using neural field dynamics in the con-text of attentional control. LectureNotes in Computer Science, 2415:1237–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151237.htm; http:/


REFERENCES 330

series/0558/papers/2415/24151237.

pdf.

Teichert:2002:CAA

[1769] Jens Teichert and Rainer Malaka. Acomponent association architecture forimage understanding. Lecture Notesin Computer Science, 2415:1243–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151243.htm; http:/


series/0558/papers/2415/24151243.

pdf.

Owens:2002:NDV

[1770] Jonathan Owens, Andrew Hunter,and Eric Fletcher. Novelty detec-tion in video surveillance using hi-erarchical neural networks. LectureNotes in Computer Science, 2415:1249–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151249.htm; http:/


series/0558/papers/2415/24151249.

pdf.

Sturzl:2002:VCD

[1771] Wolfgang Sturzl, Ulrich Hoffmann,and Hanspeter A. Mallot. Ver-gence control and disparity estima-tion with energy neurons: Theoryand implementation. Lecture Notesin Computer Science, 2415:1255–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151255.htm; http:/


series/0558/papers/2415/24151255.

pdf.

Ludtke:2002:PCM

[1772] Niklas Ludtke, Richard C. Wilson, andEdwin R. Hancock. Population codingof multiple edge orientation. LectureNotes in Computer Science, 2415:1261–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151261.htm; http:/


series/0558/papers/2415/24151261.

pdf.

Planta:2002:NMF

[1773] Cyrill Planta, Jorg Conradt, AdrianJencik, and Paul Verschure. A neu-ral model of the fly visual system ap-plied to navigational tasks. LectureNotes in Computer Science, 2415:1268–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151268.htm; http:/


series/0558/papers/2415/24151268.

pdf.

Shimomura:2002:NNM

[1774] Masao Shimomura, Shunji Satoh,Shogo Miyake, and Hirotomo Aso.A neural network model for pat-tern recognition based on hypothe-sis and verification with moving re-gion of attention. Lecture Notesin Computer Science, 2415:1275–??,2002. CODEN LNCSD9. ISSN

REFERENCES 331



bibs/2415/24151275.htm; http:/


series/0558/papers/2415/24151275.

pdf.

Ceguerra:2002:AFV

[1775] Anna Ceguerra and Irena Koprin-ska. Automatic fingerprint verifica-tion using neural networks. LectureNotes in Computer Science, 2415:1281–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151281.htm; http:/


series/0558/papers/2415/24151281.

pdf.

Li:2002:FIM

[1776] Shutao Li, James T. Kwok, andYaonan Wang. Fusing imageswith multiple focuses using supportvector machines. Lecture Notesin Computer Science, 2415:1287–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151287.htm; http:/


series/0558/papers/2415/24151287.

pdf.

Heittmann:2002:AVP

[1777] Arne Heittmann, Ulrich Ramacher,Daniel Matolin, Jorg Schreiter, andRene Schuffny. An analog VLSIpulsed neural network for imagesegmentation using adaptive con-

nection weights. Lecture Notesin Computer Science, 2415:1293–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151293.htm; http:/


series/0558/papers/2415/24151293.

pdf.

Foucher:2002:KMA

[1778] Christophe Foucher, Daniel Le Guen-nec, and Gilles Vaucher. Koho-nen maps applied to fast imagevector quantization. Lecture Notesin Computer Science, 2415:1299–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151299.htm; http:/


series/0558/papers/2415/24151299.

pdf.

Acciani:2002:UNN

[1779] Giuseppe Acciani, Ernesto Chiaran-toni, Daniela Girimonte, and CataldoGuaragnella. Unsupervised — neu-ral network approach for efficientvideo description. Lecture Notesin Computer Science, 2415:1305–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151305.htm; http:/


series/0558/papers/2415/24151305.

pdf.

REFERENCES 332

Ntalianis:2002:NNR

[1780] Klimis S. Ntalianis, Nikolaos D.Doulamis, Anastasios D. Doulamis,and Stefanos D. Kollias. Neuralnetworks retraining for unsupervisedvideo object segmentation of video-conference sequences. Lecture Notesin Computer Science, 2415:1312–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151312.htm; http:/


series/0558/papers/2415/24151312.

pdf.

Behnke:2002:LFL

[1781] Sven Behnke. Learning face lo-calization using hierarchical recur-rent networks. Lecture Notes inComputer Science, 2415:1319–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151319.htm; http:/


series/0558/papers/2415/24151319.

pdf.

Fasel:2002:CFD

[1782] Ian R. Fasel and Javier R. Movel-lan. A comparison of face de-tection algorithms. Lecture Notesin Computer Science, 2415:1325–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151325.htm; http:/


series/0558/papers/2415/24151325.

pdf.

Boni:2002:AMS

[1783] Andrea Boni. Adaptive model selec-tion for digital linear classifiers. LectureNotes in Computer Science, 2415:1333–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151333.htm; http:/


series/0558/papers/2415/24151333.

pdf.

Angulo:2002:SLF

[1784] Vicente Ruiz de Angulo and CarmeTorras. Sequential learning in feedfor-ward networks: Proactive and retroac-tive interference minimization. LectureNotes in Computer Science, 2415:1339–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151339.htm; http:/


series/0558/papers/2415/24151339.

pdf.

Anguita:2002:AHT

[1785] Davide Anguita, Sandro Ridella, FabioRivieccio, and Rodolfo Zunino. Auto-matic hyperparameter tuning for sup-port vector machines. Lecture Notesin Computer Science, 2415:1345–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151345.htm; http:/


REFERENCES 333

series/0558/papers/2415/24151345.

pdf.

Schraudolph:2002:CDS

[1786] Nicol N. Schraudolph and Thore Grae-pel. Conjugate directions for stochas-tic gradient descent. Lecture Notesin Computer Science, 2415:1351–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151351.htm; http:/


series/0558/papers/2415/24151351.

pdf.

Tino:2002:ABR

[1787] Peter Tino and Barbara Hammer. Ar-chitectural bias in recurrent neuralnetworks — fractal analysis. LectureNotes in Computer Science, 2415:1359–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151359.htm; http:/


series/0558/papers/2415/24151359.

pdf.

Atencia:2002:CSH

[1788] Miguel A. Atencia, Gonzalo Joya,and Francisco Sandoval. Continuous-state Hopfield dynamics based on im-plicit numerical methods. LectureNotes in Computer Science, 2415:1365–??, 2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151365.htm; http:/


series/0558/papers/2415/24151365.

pdf.

Riaza:2002:TSR

[1789] Ricardo Riaza and Pedro J. Zu-firia. Time-scaling in recurrentneural learning. Lecture Notesin Computer Science, 2415:1371–??,2002. CODEN LNCSD9. ISSN0302-9743 (print), 1611-3349 (elec-tronic). URL http://link.springer-


bibs/2415/24151371.htm; http:/


series/0558/papers/2415/24151371.

pdf.

Anonymous:2002:AIaaaat




ftp.math.utah.eduftp.math.utah.edu/pub//tex/bib/lncs2002c.pdf · A Bibliography of Papers in...

Documents

Transcript of ftp.math.utah.eduftp.math.utah.edu/pub//tex/bib/lncs2002c.pdf · A Bibliography of Papers in...