default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCoRR, November 2000
- Atsushi Fujii, Tetsuya Ishikawa:
Utilizing the World Wide Web as an Encyclopedia: Extracting Term Descriptions from Semi-Structured Texts. - Atsushi Fujii, Tetsuya Ishikawa:
A Novelty-based Evaluation Method for Information Retrieval. - Atsushi Fujii, Tetsuya Ishikawa:
Applying Machine Translation to Two-Stage Cross-Language Information Retrieval. - Jörn Müller-Quade, Hideki Imai:
Anonymous Oblivious Transfer. - Michiel Ronsse, Koenraad De Bosschere:
Non-intrusive on-the-fly data race detection using execution replay. - Michiel Ronsse, Koenraad De Bosschere, Jacques Chassin de Kergommeaux:
Execution replay and debugging. - Khalil Sima'an:
Tree-gram Parsing: Lexical Dependencies and Structural Relations. - Manfred Schmidt-Schauß, Michael Huber:
A Lambda-Calculus with letrec, case, constructors and non-determinism. - David Eppstein:
Small Maximal Independent Sets and Faster Exact Graph Coloring. - Dale E. Parson, Bryan Schlieder, Paul Beatty:
Extension Language Automation of Embedded System Debugging. - Jean Berstel, Luc Boasson:
Formal Properties of XML Grammars and Languages. - Joseph Y. Halpern, Judea Pearl:
Causes and Explanations: A Structural-Model Approach, Part I: Causes. - Stefan Brass, Jürgen Dix, Burkhard Freitag, Ulrich Zukowski:
Transformation-Based Bottom-Up Computation of the Well-Founded Model. - George Yong Liu, Ray F. Zhang, Kelvin Hsu, Lawrence Camilletti:
Chip-level CMP Modeling and Smart Dummy for HDP and Conformal CVD Films. - Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
A Decomposition Theorem for Maximum Weight Bipartite Matchings. - Ming-Yang Kao, Stephen R. Tate:
Designing Proxies for Stock Market Indices is Computationally Hard. - Johann Schumann:
Automatic Debugging Support for UML Designs. - Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong:
Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns. - Christian Glaßer, Lane A. Hemaspaandra:
A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions. - Norbert Bröker:
The Use of Instrumentation in Grammar Engineering. - Raimondas Lencevicius:
On-the-fly query-based debugging with examples. - Raimondas Lencevicius, Alexander Ran, Rahav Yairi:
Apache Web Server Execution Tracing Using Third Eye. - Ming-Yang Kao, Junfeng Qi, Lei Tan:
Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions. - Sara Cohen, Werner Nutt, Alexander Serebrenik:
Algorithms for Rewriting Aggregate Queries Using Views. - Alexander Serebrenik, Danny De Schreye:
Termination analysis of logic programs using acceptability with general term orders. - Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena:
When Can You Fold a Map? - Cristinel Mateis, Markus Stumptner, Dominik Wieland, Franz Wotawa:
Model-Based Debugging of Java Programs. - David Elworthy:
Retrieval from Captioned Image Databases Using Natural Language Processing. - Yohei Ikezoe, Akira Sasaki, Yoshiki Ohshima, Ken Wakita, Masataka Sassa:
Systematic Debugging of Attribute Grammars. - Nikolay Pelov, Emmanuel De Mot, Marc Denecker:
Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison. - N. Giglioli, Andrea Saltelli:
SimLab 1.1, Software for Sensitivity and Uncertainty Analysis, tool for sound modelling. - Hendrik Blockeel, Luc De Raedt, Jan Ramon:
Top-down induction of clustering trees. - Raymond Kosala, Hendrik Blockeel:
Web Mining Research: A Survey. - Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde:
Semantic interpretation of temporal information by abductive inference. - Sven Verdoolaege, Marc Denecker, Frank Van Eynde:
Abductive reasoning with temporal information. - Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
Automatic Termination Analysis of Programs Containing Arithmetic Predicates. - Klaus Aehlig, Helmut Schwichtenberg:
A syntactical analysis of non-size-increasing polynomial time computation. - Miklós Csürös, Ming-Yang Kao:
Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets. - Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi:
A Complete Characterization of Complete Intersection-Type Theories. - Rens Bod:
Do All Fragments Count? - Sara Cohen, Yaron Kanza, Yakov A. Kogan, Werner Nutt, Yehoshua Sagiv, Alexander Serebrenik:
EquiX - A Search and Query Language for XML. - Hudson Turner:
Order-consistent programs are cautiously monotonic. - Horatiu Cirstea:
Rewriting Calculus: Foundations and Applications. - Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart Demoen:
Scaling Up Inductive Logic Programming by Learning from Interpretations. - Tanya Y. Berger-Wolf, Edward M. Reingold:
Index Assignment for Multichannel Communication under Failure. - Ted Herman, Toshimitsu Masuzawa:
Available Stabilizing Heaps. - Federico Ricci-Tersenghi, Martin Weigt, Riccardo Zecchina:
Simplest random K-satisfiability problem. - Anargyros Papageorgiou, Joseph F. Traub:
Faster Evaluation of Multidimensional Integrals. - Wim van Dam, Sean Hallgren:
Efficient Quantum Algorithms for Shifted Quadratic Character Problems. - Jürgen Schmidhuber:
Algorithmic Theories of Everything.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-05 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
