default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 70
Volume 70, Number 1, February 2005
- Sergio Flesca
, Sergio Greco:
Partially ordered regular languages for graph queries. 1-25 - Chongfu Huang, Claudio Moraga:
Extracting fuzzy if-then rules by using the information matrix technique. 26-52 - Robert Legenstein, Wolfgang Maass:
Wire length as a circuit complexity measure. 53-72 - Deng-Feng Li:
Multiattribute decision making models and methods using intuitionistic fuzzy sets. 73-85 - Jin Hyun Son, Jungsun Kim, Myoung-Ho Kim:
Extracting the workflow critical path from the extended well-formed workflow schema. 86-106 - Wenxing Zhu:
A provable better Branch and Bound method for a nonconvex integer quadratic programming problem. 107-117 - Guy Even, Peter-Michael Seidel, Warren E. Ferguson:
A parametric error analysis of Goldschmidt's division algorithm. 118-139 - Sun-Yuan Hsieh:
Efficiently parallelizable problems on a class of decomposable graphs. 140-156 - Lila Kari, Stavros Konstantinidis:
Language equations, maximality and error-detection. 157-178
Volume 70, Number 2, March 2005
- David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien:
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. 101-127 - Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu:
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. 128-144 - Susanne Albers, Lene M. Favrholdt, Oliver Giel:
On paging with locality of reference. 145-175 - Daowen Qiu, Huaiqing Wang:
A probabilistic model of computing with words. 176-200 - Jia Lee, Susumu Adachi, Ferdinand Peper, Shinro Mashiko:
Delay-insensitive computation in asynchronous cellular automata. 201-220 - Frank Neven:
Attribute grammars for unranked trees as a query language for structured documents. 221-257 - Antonella Santone, Gigliola Vaglini:
A local approach for temporal model checking of Java bytecode. 258-281
Volume 70, Number 3, May 2005
- Richard M. Karp, Ming Li, Pavel A. Pevzner, Ron Shamir:
Guest Editors' foreword. 283- - Lusheng Wang, Daming Zhu, Xiaowen Liu, Shaohan Ma:
An O(n2) algorithm for signed translocation. 284-299 - Tzvika Hartman, Roded Sharan:
A 1.5-approximation algorithm for sorting by transpositions and transreversals. 300-320 - Haim Kaplan, Elad Verbin:
Sorting signed permutations by reversals, revisited. 321-341 - Jeremy Buhler, Uri Keich, Yanni Sun:
Designing seeds for similarity search in genomic DNA. 342-363 - Brona Brejová, Daniel G. Brown, Tomás Vinar:
Vector seeds: An extension to spaced seeds. 364-380 - Dan Gusfield:
Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination. 381-398 - Yonatan Aumann, Efrat Manisterski, Zohar Yakhini:
Designing optimally multiplexed SNP genotyping assays. 399-417 - Bin Ma, Kaizhong Zhang, Chengzhi Liang:
An effective algorithm for peptide de novo sequencing from MS/MS spectra. 418-430
Volume 70, Number 4, June 2005
- Robert H. Sloan:
Special issue on computational learning theory. 433-434 - Lisa Hellerstein, Vijay Raghavan:
Exact learning of DNF formulas using DNF hypotheses. 435-470 - Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon:
Exploring learnability between exact and PAC. 471-484 - Ke Yang:
New lower bounds for statistical query learning. 485-509 - Sandra Zilles:
Increasing the power of uniform inductive learners. 510-538 - Michael V. Vyugin, Vladimir V. V'yugin:
Predictive complexity and information. 539-554 - Sanjoy Dasgupta, Philip M. Long:
Performance guarantees for hierarchical clustering. 555-569 - Lance Fortnow, Jack H. Lutz:
Prediction and dimension. 570-589
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-12-09 00:13 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:
