Efficient tree-based revocation in groups of low-state devicesGOODRICH, Michael T; SUN, Jonathan Z; TAMASSIA, Roberto et al.Lecture notes in computer science. 2004, pp 511-527, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Sur l'efficacité d'une méthode hybride de résolution des problèmes d'optimisation discrèteVENIAMINOV, S. S.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1986, Num 1, pp 21-26, issn 0002-3388Article

Automatic generation of answers using solution network for mathematical exercisesKOJIRI, Tomoko; HOSONO, Sachiyo; WATANABE, Toyohide et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28894-5, vol3, 1303-1309Conference Paper

On identifying tree-structured perfect mapsBORGELT, Christian.Lecture notes in computer science. 2003, pp 385-395, issn 0302-9743, isbn 3-540-20059-2, 11 p.Conference Paper

Vainqueurs de Kemeny et tournois difficiles = Kemeny winners and hard tournamentsGUENOCHE, A.Mathématiques, informatique et sciences humaines. 1996, Num 133, pp 57-65, issn 0995-2314Article

Organisation des branchements pour la solution des problèmes d'unification par des algorithmes correcteursGOL'DENGORIN, B. I.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1986, Num 3, pp 167-169, issn 0002-3388Article

Non-negative regression by givens rotationsBATES, D. M; WOLF, D. A.Communications in statistics. Simulation and computation. 1984, Vol 13, Num 6, pp 841-846, issn 0361-0918Article

Behavior description and control using behavior module for personal robotHOSHINO, Yukiko; TAKAGI, Tsuyoshi; DI PROFIO, Ugo et al.IEEE International Conference on Robotics and Automation. 2004, pp 4165-4171, isbn 0-7803-8232-3, 5Vol, 7 p.Conference Paper

Tree pattern relaxationAMER-YAHIA, Sihem; CHO, Sungran; SRIVASTAVA, Divesh et al.Lecture notes in computer science. 2002, pp 496-513, issn 0302-9743, isbn 3-540-43324-4Conference Paper

Minimally colored treesRINSMA, I; HENDY, M; PENNY, D et al.Mathematical biosciences. 1990, Vol 98, Num 2, pp 201-210, issn 0025-5564Article

Sur un problème spécial de programmation entièreALEKSEEV, A. G; KEZHAEV, V. A; SUBBOTIN, A. I et al.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1986, Num 4, pp 16-20, issn 0002-3388Article

Describing lambda terms in context unificationNIEHREN, Joachim; VILLARET, Mateu.Lecture notes in computer science. 2005, pp 221-237, issn 0302-9743, isbn 3-540-25783-7, 17 p.Conference Paper

Sampling of unique structures and behaviours in genetic programmingGUSTAFSON, Steven; BURKE, Edmund K; KENDALL, Graham et al.Lecture notes in computer science. 2004, pp 279-288, issn 0302-9743, isbn 3-540-21346-5, 10 p.Conference Paper

Complexity-constrained tree-structured vector quantizersCARDINAL, Jean.Signal processing. 2002, Vol 82, Num 8, pp 1176-1182, issn 0165-1684Article

GPE: A new representation for VLSI floorplan problemLIN, Chang-Tzu; CHEN, De-Sheng; WANG, Yi-Wen et al.Proceedings, IEEE International Conference on Computer Design. 2002, pp 42-44, issn 1063-6404, isbn 0-7695-1700-5, 3 p.Conference Paper

Scaling in the structure of directory trees in a computer clusterKLEMM, Konstantin; EGUILUZ, Victor M; SAN MIGUEL, Maxi et al.Physical review letters. 2005, Vol 95, Num 12, pp 128701.1-128701.4, issn 0031-9007Article

Mining frequent tree-like patterns in large datasetsCHEN, Tzung-Shi; HSU, Shih-Chun.Lecture notes in computer science. 2005, pp 561-567, issn 0302-9743, isbn 3-540-25334-3, 7 p.Conference Paper

PK+ tree : An improved spatial index structure of PK treeXIAOLIN WANG; YINGWEI LUO; LISHAN YU et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part III, 511-514Conference Paper

A new approach to deadlock avoidance in embedded systemGANG WU; ZHIQIANG TANG; SHILIANG TU et al.Lecture notes in computer science. 2005, pp 395-399, issn 0302-9743, isbn 3-540-28128-2, 1Vol, 5 p.Conference Paper

Automated validation of service configuration on network devicesHALLE, Sylvain; DECA, Rudy; CHERKAOUI, Omar et al.Lecture notes in computer science. 2004, pp 176-188, issn 0302-9743, isbn 3-540-23239-7, 13 p.Conference Paper

Adjusting dependence relations for semi-lazy TAN classifiersZHIHAI WANG; WEBB, Geoffrey I; FEI ZHENG et al.Lecture notes in computer science. 2003, pp 453-465, issn 0302-9743, isbn 3-540-20646-9, 13 p.Conference Paper

Information extraction in structured documents using tree automata inductionKOSALA, Raymond; VAN DEN BUSSCHE, Jan; BRUYNOOGHE, Maurice et al.Lecture notes in computer science. 2002, pp 299-310, issn 0302-9743, isbn 3-540-44037-2, 12 p.Conference Paper

Prague dependency treebank : Restoration of deletionsHAJICOVA, E; KRUIJFF-KORBAYOVA, I; SGALL, P et al.Lecture notes in computer science. 1999, Vol 1692, pp 44-49, issn 0302-9743, isbn 3-540-66494-7Conference Paper

Known plaintext cryptanalysis of tree-structured block ciphersHEYS, H. M; TAVARES, S. E.Electronics Letters. 1995, Vol 31, Num 10, pp 784-785, issn 0013-5194Article

A complementary view on the growth of directory treesGEIPEL, M. M; TESSONE, C. J; SCHWEITZER, F et al.The European physical journal. B, Condensed matter physics (Print). 2009, Vol 71, Num 4, pp 641-648, issn 1434-6028, 8 p.Article