Sciweavers

358 search results - page 26 / 72
» Report on Generic Case Complexity
Sort
View
105
Voted
CORR
1998
Springer
84views Education» more  CORR 1998»
15 years 3 months ago
A Variant of Earley Parsing
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed” recognit...
Mark-Jan Nederhof, Giorgio Satta
119
Voted
ESOP
2001
Springer
15 years 8 months ago
Control-Flow Analysis in Cubic Time
Abstract. It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of c...
Flemming Nielson, Helmut Seidl
199
Voted
ICDE
1998
IEEE
153views Database» more  ICDE 1998»
16 years 5 months ago
Flattening an Object Algebra to Provide Performance
Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in OODBMS is difficult due to the complexity o...
Peter A. Boncz, Annita N. Wilschut, Martin L. Kers...
CAISE
2009
Springer
15 years 10 months ago
Deriving Information Requirements from Responsibility Models
Abstract. This paper describes research in understanding the requirements for complex information systems that are constructed from one or more generic COTS systems. We argue that,...
Ian Sommerville, Russell Lock, Tim Storer, John Do...
253
Voted
CBMS
2006
IEEE
15 years 9 months ago
A Conceptual Grid Architecture for Interactive Biomedical Applications
The growing complexity of distributed biomedical application requirements present new challenges to the representation of software architectural analysis and design. This is the c...
Alfredo Tirado-Ramos, Peter M. A. Sloot