Sciweavers

2835 search results - page 514 / 567
» Automatic Question Answering
Sort
View
169
Voted
ICALP
1997
Springer
15 years 9 months ago
Recursive Computational Depth
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
James I. Lathrop, Jack H. Lutz
RECOMB
1997
Springer
15 years 9 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
IWSSD
1993
IEEE
15 years 9 months ago
Fine-Grain Process Modelling
In this paper, we propose the use of fine-grain process modelling as an aid to software development. We suggest the use of two levels of granularity, one at the level of the indiv...
Bashar Nuseibeh, Anthony Finkelstein, Jeff Kramer
144
Voted
CHI
1993
ACM
15 years 9 months ago
An evaluation of earcons for use in auditory human-computer interfaces
An evaluation of earcons was carried out to see whether they are an effective means of communicating information in sound. An initial experiment showed that earcons were better th...
Stephen A. Brewster, Peter C. Wright, Alistair D. ...
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 9 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin