Ident. | Authors (with country if any) | Title |
---|
000005 |
Henri Casanova [États-Unis] ; Arnaud Giersch [France] ; Arnaud Legrand [France] ; Martin Quinson [France] ; Frédéric Suter [France] | Versatile, scalable, and accurate simulation of distributed applications and platforms |
000008 |
Thai V. Hoang [France] ; Elisa H. Barney Smith [États-Unis] ; Salvatore Tabbone [France] | Sparsity-based edge noise removal from bilevel graphical document images |
000015 |
Antoine Liutkus [France] ; Derry Fitzgerald [Irlande (pays)] ; Zafar Rafii [États-Unis] ; Bryan Pardo [États-Unis] ; Laurent Daudet [France] | Kernel Additive Models for Source Separation |
000029 |
Raphael Fonteneau [Belgique] ; Susan A. Murphy [États-Unis] ; Louis Wehenkel [Belgique] ; Damien Ernst [Belgique] | Strategies d'échantillonnage pour l'apprentissage par renforcement batch |
000047 |
Robin Strand [Suède] ; Krzysztof Chris Ciesielski [États-Unis] ; Filip Malmberg [Suède] ; Punam K. Saha [États-Unis] | The minimum barrier distance |
000053 |
Pavel Naumov [États-Unis] ; Brittany Nicholls [États-Unis] | On interchangeability of Nash equilibria in multi-player strategic games |
000062 |
Wesley H. Holliday [États-Unis] ; Tomohiro Hoshi [États-Unis] ; Thomas F. Iii Icard [États-Unis] | Information dynamics and uniform substitution |
000133 |
Bart Lamiroy [France] ; Daniel Lopresti [États-Unis] ; Hank Korth [États-Unis] ; Jeff Heflin [États-Unis] | How Carefully Designed Open Resource Sharing Can Help and Expand Document Analysis Research |
000134 |
S. Chevillard [France] ; J. Harrison [États-Unis] ; M. Joldes [France] ; Ch. Lauter [France] | Efficient and accurate computation of upper bounds of approximation errors |
000138 |
Christopher Lynch [États-Unis] ; Silvio Ranise [Italie] ; Christophe Ringeissen [France] ; Duc-Khanh Tran [Namibie] | Automatic decidability and combinability |
000242 |
Philip Feinsilver [États-Unis] ; René Schott [France] | Finite-dimensional calculus |
000272 |
René Schott [France] ; George Stacey Staples [États-Unis] | Nilpotent adjacency matrices, random graphs and quantum random variables |
000275 |
Hervé Brönnimann [États-Unis] ; Olivier Devillers [France] ; Vida Dujmovic [Canada] ; Hazel Everett [France] ; Marc Glisse [France] ; Xavier Goaoc [France] ; Sylvain Lazard [France] ; Hyeon-Suk Na [Corée du Sud] ; Sue Whitesides [Canada] | LINES AND FREE LINE SEGMENTS TANGENT TO ARBITRARY THREE-DIMENSIONAL CONVEX POLYHEDRA |
000342 |
Olivier Chevassut [États-Unis] ; Pierre-Alain Fouque [France] ; Pierrick Gaudry [France] ; David Pointcheval [France] | The Twist-AUgmented Technique for Key Exchange |
000379 |
Martin Abadi [États-Unis] ; Mathieu Baudet [France] ; Bogdan Warinschi [France] | Guessing attacks and the computational soundness of static equivalence |
000395 |
TING ZHANG [États-Unis] ; Henny B. Sipma [États-Unis] ; Zohar Manna [États-Unis] | Decision procedures for term algebras with integer constraints |
000396 |
Manin Abadi [États-Unis] ; Véronique Cortier [France] | Deciding knowledge in security protocols under equational thoories |
000402 |
Michael Backes [Allemagne] ; Anupam Datta [États-Unis] ; Ante Derek [États-Unis] ; John C. Mitchell [États-Unis] ; Mathieu Turuani [France] | Compositional analysis of contract-signing protocols |
000407 |
JIA MENG [États-Unis] ; Claire Quigley [États-Unis] ; Lawrence C. Paulson [États-Unis] | Automation for interactive proof : First prototype |
000417 |
Franz Baader [Allemagne] ; Silvio Ghilardi [Italie] ; Cesare Tinelli [États-Unis] | A new combination procedure for the word problem that generalizes fusion decidability results in modal logics |
000424 |
Paul Zimmermann [France] ; Bruce Dodson [États-Unis] | 20 Years of ECM |
000457 |
Shelby Funk [États-Unis] ; Sanjoy K. Baruah | Restricting EDF migration on uniform heterogeneous multiprocessors |
000464 |
Anupam Datta [États-Unis] ; Ante Derek [États-Unis] ; John C. Mitchell [États-Unis] ; Vitaly Shmatikov [États-Unis] ; Mathieu Turuani [France] | Probabilistic polynomial-time semantics for a protocol security logic |
000480 |
Slim Ouni [États-Unis] ; Yves Laprie [France] | Modeling the articulatory space using a hypercube codebook for acoustic-to-articulatory inversion |
000507 |
Véronique Cortier [France] ; Bogdan Warinschi [États-Unis] | Computationally sound, automated proofs for security protocols |
000513 |
Silvio Ranise [États-Unis] ; Christophe Ringeissen [États-Unis] ; Calogero G. Zarba [États-Unis] | Combining data structures with nonstably infinite theories using many-sorted logic |
000514 |
Mathilde Bouvel [France] ; Vladimir Grebinski [États-Unis] ; Gregory Kucherov [France] | Combinatorial search on graphs motivated by bioinformatics applications : A brief survey |
000515 |
Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Closure properties and decision problems of dag automata |
000520 |
Ernst Althaus [France] ; Stefan Funke [Allemagne] ; Sariel Har-Peled [États-Unis] ; Jochen Könemann [Canada] ; Edgar A. Ramos [États-Unis] ; Martin Skutella [Allemagne] | Approximating k-hop minimum-spanning trees |
000556 |
Christophe Cerisara [France] ; Luca Rigazio [États-Unis] ; Jean-Claude Junqua [États-Unis] | α-Jacobian environmental adaptation |
000563 |
Laurent Alonso [France] ; Philippe Chassaing [France] ; Edward M. Reingold [États-Unis] ; René Schott [France] | The worst-case chip problem |
000582 |
Egon Balas [États-Unis] ; Alexander Bockmayr [France] ; Nicolai Pisaruk [France] ; Laurence Wolsey [Belgique] | On unions and dominants of polytopes |
000585 |
James S. Royer [États-Unis] | On the computational complexity of Longley's H functional |
000591 |
N. Danner [États-Unis] ; C. Pollett [États-Unis] | Minimization and NP multifunctions |
000597 |
Daniel Leivant [États-Unis] | Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion |
000617 |
Martin Abadi [États-Unis] ; Veronique Cortier [France] | Deciding knowledge in security protocols under equational theories |
000619 |
Michel Cosnard [France] ; Emmanuel Jeannot [France] ; TAO YANG [États-Unis] | Compact DAG representation and its symbolic scheduling |
000621 |
Cesare Tinelli [États-Unis] ; Calogero G. Zarba [France] | Combining decision procedures for sorted theories |
000623 |
Alexander Keller [États-Unis] ; Remi Badonnel [France] | Automating the provisioning of application services with the BPEL4WS workflow language |
000625 |
Ralph Benzinger [États-Unis] | Automated higher-order complexity analysis |
000663 |
Cesare Tinelli [États-Unis] ; Christophe Ringeissen [France] | Unions of non-disjoint theories and combinations of satisfiability procedures |
000664 |
Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Unification modulo ACUI plus homomorphisms/distributivity |
000679 |
Gilles Barthe [États-Unis, France] ; Horatiu Cirstea ; Claude Kirchner ; Luigi Liquori | Pure patterns Type systems |
000682 |
Henry S. Baird [États-Unis] ; Allison L. Coates [États-Unis] ; Richard J. Fateman [États-Unis] | PessimalPrint: a reverse Turing test |
000683 |
JUYANG WENG [États-Unis] ; Wey-Shiuan Hwang [États-Unis] | Online image classification using IHDR |
000704 |
David Crandall [États-Unis] ; Sameer Antani [États-Unis] ; Rangachar Kasturi [États-Unis] | Extraction of special effects caption text events from digital video |
000706 |
Yannick Chevalier [France] ; Ralf Küsters [États-Unis] ; Michaël Rusinowitch [France] ; Mathieu Turuani [France] ; Laurent Vigneron [France] | Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions |
000714 |
Yannick Chevalier [France] ; Ralf Küsters [États-Unis] ; Michaël Rusinowitch [France] ; Mathieu Turuani [États-Unis] | Deciding the security of protocols with Diffie-Hellman Exponentiation and products in exponents |
000715 |
John F. Pitrelli [États-Unis] ; Amit Roy [États-Unis] | Creating word-level language models for large-vocabulary handwriting recognition |
000727 |
Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | ACID-unification is NEXPTIME-decidable |
000774 |
Ernst Althaus [États-Unis] ; Alexander Bockmayr [France] ; Matthias Elf [Allemagne] ; Michael Jünger [Allemagne] ; Thomas Kasper [Allemagne] ; Kurt Mehlhorn [Allemagne] | SCIL: Symbolic constraints in integer linear programming |
000801 |
Dominique Cansell [France] ; Ganesh Gopalakrishnan [États-Unis] ; Mike Jones [États-Unis] ; Dominique Méry [France] ; Airy Weinzoepflen [France] | Incremental proof of the producer/consumer property for the PCI protocol |
000804 |
Nicolas Remy [États-Unis] ; Arben Shtuka [France] ; Bruno Levy [France] ; Jef Caers [États-Unis] | GSTL: the geostatistical template library in C++ |
000810 |
Christophe Cerisara [France] ; Jean-Claude Junqua [États-Unis] ; Luca Rigazio [États-Unis] | Dynamic estimation of a noise over estimation factor for Jacobian-based adaptation |
000814 |
Pankaj K. Agarwal [États-Unis] ; Therese Biedl [Canada] ; Sylvain Lazard [France] ; Steve Robbins [Canada] ; Subhash Suri [États-Unis] ; Sue Whitesides [Canada] | Curvature-constrained shortest paths in a convex polygon |
000824 |
Oliver Lemon [États-Unis] ; Alexander Gruenstein [États-Unis] ; Stanley Peters [États-Unis] | Collaborative activities and multi-tasking in dialogue systems: Towards natural dialogue with robots |
000906 |
Elias Dahlhaus [Allemagne] ; Jens Gustedt [France] ; Ross M. Mcconnell [États-Unis] | Efficient and practical algorithms for sequential modular decomposition |
000908 |
Vincent D. Blondel [Belgique] ; Olivier Bournez [France] ; Pascal Koiran [France] ; Christos H. Papadimitriou [États-Unis] ; John N. Tsitsiklis [États-Unis] | Deciding stability and mortality of piecewise affine dynamical systems |
000916 |
Arantza Casillas [Espagne] ; Raquel Martinez [États-Unis] | Bitext segmentation and alignment for specialized document composition |
000927 |
Nancy Ide [États-Unis] ; Laurent Romary [France] | A common framework for syntactic annotation |
000958 |
Eugene Bodansky [États-Unis] ; Morakot Pilouk [États-Unis] | Using local deviations of vectorization to enhance the performance of raster-to-vector conversion systems |
000959 |
Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
000961 |
P. Narendran [États-Unis] ; M. Rusinowitch [France] | The theory of total unary RPO is decidable |
000962 |
V. D. Blondel [Belgique] ; O. Bournez [France] ; P. Koiran [France] ; J. N. Tsitsiklis [États-Unis] | The stability of saturated linear dynamical systems is undecidable |
000967 |
A. Durand [France] ; M. Hermann [France] ; P. G. Kolaitis [États-Unis] | Subtractive reductions and complete problems for counting complexity classes |
000969 |
A. Bouhoula [États-Unis, France] ; J.-P. Jouannaud [France] ; J. Meseguer [États-Unis] | Specification and proof in membership equational logic |
000970 |
J. L. Caldwell [États-Unis] ; I. P. Gent [Royaume-Uni] ; J. Underwood [Royaume-Uni] | Search algorithms in type theory |
000985 |
E. Fleury [France] ; YIH HUANG [États-Unis] ; P. K. Mckinley [États-Unis] | On the performance and feasibility of multicast core selection heuristics |
000A02 |
S. Cavallar [Pays-Bas] ; B. Dodson [États-Unis] ; A. K. Lenstra [États-Unis] ; W. Lioen [Pays-Bas] ; P. L. Montgomery [États-Unis] ; B. Murphy [Australie] ; H. Te Riele [Pays-Bas] ; K. Aardal [Pays-Bas] ; J. Gilchrist [Canada] ; G. Guillerm [France] ; P. Leyland [Royaume-Uni] ; J. Marchand [France] ; F. Morain [France] ; A. Muffett [Royaume-Uni] ; C. Putman [États-Unis] ; C. Putnam [États-Unis] ; P. Zimmermann [France] | Factorization of a 512-bit RSA modulus |
000A03 |
T. Arai [Japon] ; G. Mints [États-Unis] | Extended normal form theorems for logical proofs from axioms |
000A05 |
I. Cervesato [États-Unis] ; J. S. Hodas [États-Unis] ; F. Pfenning [États-Unis] | Efficient resource management for linear logic proof search |
000A12 |
R. Mcdowell [États-Unis] ; D. Miller [États-Unis] | Cut-elimination for a logic with definitions and induction |
000A14 |
G. Nadathur [États-Unis] | Correspondences between classical, intuitionistic and uniform provability |
000A17 |
L. Bachmair [États-Unis] ; I. V. Ramakrishnan [États-Unis] ; A. Tiwari [États-Unis] ; L. Vigneron [France] | Congruence closure modulo associativity and commutativity |
000A34 |
D. Leivant [États-Unis] ; J.-Y. Marion [France] | A characterization of alternating log time by ramified recurrence |
000A65 |
D. A. Plaisted [États-Unis] ; G. Kucherov [France] | The complexity of some complementation problems |
000A68 |
P. Narendran [États-Unis] ; M. Rusinowitch [France] ; R. Verma [États-Unis] | RPO constraint solving is in NP |
000A71 |
M. Hermann [France] ; L. Juban [France] ; P. G. Kolaitis [États-Unis] | On the complexity of counting the Hilbert basis of a linear Diophantine system |
000A72 |
A. Bockmayr [France] ; F. Eisenbrand [Allemagne] ; M. Hartmann [États-Unis] ; A. S. Schulz [États-Unis] | On the Chvátal rank of polytopes in the 0/1 cube |
000A79 |
T. Es-Sqalli [France] ; E. Fleury [France] ; E. Dillon [États-Unis] ; J. Guyard [France] | Message-passing specification in a CORBA environment |
000A85 |
S. Cavallar [Pays-Bas] ; W. Lioen [Pays-Bas] ; H. Te Riele [Pays-Bas] ; B. Dodson [États-Unis] ; A. Lenstra [États-Unis] ; P. Leyland [Royaume-Uni] ; P. L. Montgomery [États-Unis] ; B. Murphy [Australie] ; P. Zimmermann [France] | Factorization of RSA-140 using the number field Sieve |
000A86 |
S. Cavallar [Pays-Bas] ; B. Dodson [États-Unis] ; A. Lenstra [États-Unis] ; P. Leyland [Royaume-Uni] ; W. Lioen [Pays-Bas] ; P. L. Montgomery [États-Unis] ; B. Murphy [Australie] ; H. Te Riele [Pays-Bas] ; P. Zimmermann [France] | Factorization of RSA-140 using the Number Field sieve |
000B02 |
H. Kirchner [France] ; P. D. Mosses [États-Unis] | Algebraic specifications, higher-order types, and set-theoretic models |
000B31 |
H. Hermansky [États-Unis, République tchèque] | Should recognizers have ears? |
000B33 |
B. E. D. Kingsbury [États-Unis] ; N. Morgan [États-Unis] ; S. Greenberg [États-Unis] | Robust speech recognition using the modulation spectrogram |
000B39 |
C.-H. Lee [États-Unis] | On stochastic feature and model compensation approaches to robust speech recognition |
000B54 |
I. Illina [France] ; M. Afify [France] ; Y. Gong [États-Unis] | Environment normalization training and environment adaptation using mixture stochastic trajectory model |
000B62 |
C. Lynch [États-Unis] ; C. Scharff [France] | Basic Completion with E-cycle Simplification |
000B63 |
B. L. Pellom [États-Unis] ; J. H. L. Hansen [États-Unis] | Automatic segmentation of speech recorded in unknown noisy channel characteristics |
000B69 |
M. Afify [France] ; YIFAN GONG [États-Unis] ; Jean-Paul Haton [France] | A general joint additive and convolutive bias compensation approach applied to noisy lombard speech recognition |
000B86 |
R. Fiengo [États-Unis] ; R. May [États-Unis] ; A. Reboul | L'importance sémantique de l'identité syntaxique |
000B87 |
N. Asher [États-Unis] ; A. Reboul | Evénements, faits, propositions et anaphore évolutive |
000C04 |
L. Alonso [France] ; E. M. Reingold [États-Unis] ; R. Schott [France] | The average-case complexity of determining the majority |
000C08 |
A. Bouhoula [États-Unis, France] ; J.-P. Jouannaud [États-Unis, France] ; J. Meseguer [États-Unis] | Specification and proof in membership equational logic |
000C14 |
D. Leivant [États-Unis] ; J.-Y. Marion [France] | Predicative functional recurrence and poly-space |
000C19 |
M. Hermann [France] ; P. G. Kolaitis [États-Unis] | On the complexity of unification and disunification in commutative idempotent semigroups |
000C27 |
M. A. Gernsbacher [États-Unis] | Generic pronominal anaphora : The case of the English "Singular They" |
000C31 |
B. Chetali [États-Unis] ; B. Heyd [États-Unis] | Formal verification of concurrent programs in LP and in COQ : A comparative analysis |
000C32 |
I. Illina [France] ; Y. Gong [États-Unis] | Elimination of trajectory folding phenomenon : HMM, trajectory mixture HMM and mixture stochastic trajectory model |
000C45 |
M. Afify [France] ; Y. Gong [États-Unis] ; Jean-Paul Haton [France] | A unified maximum likelihood approach to acoustic mismatch compensation : Application to noisy lombard speech recognition |
000C74 |
M. Hermann [France] ; P. G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
000C79 |
L. Vigneron [France] ; A. Wasilewska [États-Unis] | Rough and modal algebras |
000C86 |
P. Feinsilver [États-Unis] ; R. Schott [France] | Operator calculus approach to orthogonal polynomial expansions |
000D31 |
P. Feinsilver [États-Unis, France] ; U. Franz [France] ; R. Schott | Feynman-Kac formula and appell systems on quantum groups |
000D34 |
B. Simonnot [États-Unis] | A cooperation model for video document retrieval |
000D37 |
B. Fortier [France] ; J. Castex [France] ; J. L. Cohen [France, États-Unis] ; F. Loyer [France] ; J.-C. Depaule [France] ; A. Berque [France] ; O. Marcel [France] ; S. Ostrowetsky [France] ; F. Darve [France] ; J.-C. Paul [France] ; J.-P. Perrin [France] ; J.-C. Andre [France] ; S. Corbel [France] ; Y. Tsiomis [France] ; A. Leobon [France] ; J.-P. Peneau [France] ; R. Baudouï [France] ; B. Lassus [France] ; V. Biau [France] ; B. Haumont [France] | Formes et paysages |
000D49 |
P. Feinsilver [États-Unis] ; J. Kocik [États-Unis] ; R. Schott [France] | Representations and stochastic processes on groups of type-H |