default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCoRR, December 2001
- Leonid A. Levin, Ramarathnam Venkatesan:
An Average Case NP-complete Graph Problem. - Iain A. Stewart:
Program schemes with binary write-once arrays and the complexity classes they capture. - Masaki Murata, Kiyotaka Uchimoto, Qing Ma, Hitoshi Isahara:
Using a Support-Vector Machine for Japanese-to-English Translation of Tense, Aspect, and Modality. - Masaki Murata, Qing Ma, Hitoshi Isahara:
Part of Speech Tagging in Thai Language Using Support Vector Machine. - Masaki Murata, Hitoshi Isahara:
Universal Model for Paraphrasing - Using Transformation Based on a Defined Criteria. - Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres:
A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity. - Floris Geerts, Bart Goethals, Jan Van den Bussche:
A Tight Upper Bound on the Number of Candidate Patterns. - Mark Burgin:
Representation of Uncertainty for Limit Processes. - Ming-Yang Kao, Vijay Ramachandran:
DNA Self-Assembly For Constructing 3D Boxes. - Kyriakos N. Sgarbas, Nikos Fakotakis, George K. Kokkinakis:
A Straightforward Approach to Morphological Analysis and Synthesis. - Bart Goethals, Jan Van den Bussche:
Interactive Constrained Association Rule Mining. - Daniel Krob, Jean Mairesse, Ioannis Michos:
Computing the average parallelism in trace monoids. - Tom Brijs, Bart Goethals, Gilbert Swinnen, Koen Vanhoof, Geert Wets:
A Data Mining Framework for Optimal Product Selection in Retail Supermarket Data: The Generalized PROFSET Model. - Adi Shamir, Boaz Tsaban:
Guaranteeing the diversity of number generators. - Moshe Tennenholtz:
Rational Competitive Analysis. - (Withdrawn) Pseudorandom permutations with the fast forward property.
- Naomi Dushay:
Using Structural Metadata to Localize Experience of Digital Content. - Lillian Lee:
Fast Context-Free Grammar Parsing Requires Fast Boolean Matrix Multiplication. - Marcus Hutter:
Distribution of Mutual Information. - Philippe Matherat, Marc-Thierry Jaekel:
Concurrent computing machines and physical space-time. - Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of the Winner Problem for Young Elections. - Qi Xiao Yang, Sam Yuan Sung, Chun Lu, Li Zhao, Sun Peng:
Faster Algorithm of String Comparison. - Pawel Wocjan, Dominik Janzing, Thomas Beth:
Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices. - Bjoern Feustel, Thomas C. Schmidt:
Media Objects in Time - A Multimedia Streaming System. - E. N. Dorband, Marc Hemsendorf, David Merritt:
Systolic and Hyper-Systolic Algorithms for the Gravitational N-Body Problem, with an Application to Brownian Motion. - György Korniss, Mark A. Novotny, Per Arne Rikvold, Hasan Guclu, Zoltán Toroczkai:
Going through Rough Times: from Non-Equilibrium Surface Growth to Algorithmic Scalability. - Andrea Montanari, Riccardo Zecchina:
Boosting search by rare events. - Luis García, Abdul Salam Jarrah, Reinhard C. Laubenbacher:
Classification of Finite Dynamical Systems. - Jeffrey O. Shallit:
The computational complexity of the local postage stamp problem. - Howard Kleiman:
The Floyd-Warshall Algorithm, the AP and the TSP, Part II.
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-19 00:45 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:
