Sciweavers

2475 search results - page 279 / 495
» On the accuracy of language trees
Sort
View
ICALP
2001
Springer
14 years 2 months ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Amit Chakrabarti, Subhash Khot
ESOP
1999
Springer
14 years 1 months ago
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
Andreas Podelski, Witold Charatonik, Martin Mü...
OORASE
1999
Springer
14 years 1 months ago
OpenJava: A Class-Based Macro System for Java
This paper presents OpenJava, which is a macro system that we have developed for Java. With traditional macro systems designed for non object-oriented languages, it is difficult to...
Michiaki Tatsubori, Shigeru Chiba, Kozo Itano, Mar...
ICGI
1998
Springer
14 years 1 months ago
A Stochastic Search Approach to Grammar Induction
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
Hugues Juillé, Jordan B. Pollack
ADC
2006
Springer
119views Database» more  ADC 2006»
14 years 1 months ago
Using reflection for querying XML documents
XML-based databases have become a major area of in database research. Abstractly speaking they can be considered as a resurrection of complexvalue databases using constructors for...
Markus Kirchberg, Faizal Riaz-ud-Din, Klaus-Dieter...