Sciweavers

6719 search results - page 1072 / 1344
» A Generalization of Automatic Sequences
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 11 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
VLDB
2001
ACM
92views Database» more  VLDB 2001»
15 years 11 months ago
Fast Evaluation Techniques for Complex Similarity Queries
Complex similarity queries, i.e., multi-feature multi-object queries, are needed to express the information need of a user against a large multimedia repository. Even if a user in...
Klemens Böhm, Michael Mlivoncic, Hans-Jö...
ICECCS
2000
IEEE
133views Hardware» more  ICECCS 2000»
15 years 11 months ago
An Analysis Tool for Coupling-Based Integration Testing
This research is part of a project to develop practical, effective, formalizable, automatable techniques for integration testing. Integration testing is an important part of the t...
A. Jefferson Offutt, Aynur Abdurazik, Roger T. Ale...
IJCNN
2000
IEEE
15 years 11 months ago
Bias Learning, Knowledge Sharing
—Biasing properly the hypothesis space of a learner has been shown to improve generalization performance. Methods for achieving this goal have been proposed, that range from desi...
Joumana Ghosn, Yoshua Bengio
TOOLS
2000
IEEE
15 years 11 months ago
Generic Components to Foster Reuse
Software reuse and especially the paradigm of software components are promising approaches to increase the efficiency of software development. One of the basic problems of softwar...
Lothar Baum, Martin Becker
« Prev « First page 1072 / 1344 Last » Next »