Sciweavers

3172 search results - page 561 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
COLING
1992
15 years 7 months ago
Planning To Fail, Not Failing To Plan: Risk-Taking And Recovery In Task-Oriented Dialogue
duplicate the route. The HCRC Dialogue Database [3] We hypothesise that agents who engage in task- contains 128 such dialogues; in this work we examined oriented dialogue usually t...
Jean Carletta
TREC
2007
15 years 7 months ago
Exegy at TREC 2007 Million Query Track
Exegy’s submission for the TREC 2007 million query track consisted of results obtained by running the queries against the raw data, i.e., the data was not indexed. The hardwarea...
Naveen Singla, Ronald S. Indeck
WICSA
2007
15 years 7 months ago
Do Architecture Design Methods Meet Architects' Needs?
Several Software Architecture Design Methods (SADM) have been published, reviewed, and compared. But these surveys and comparisons are mostly centered on intrinsic elements of the...
Davide Falessi, Giovanni Cantone, Philippe Kruchte...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 7 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
CAISE
2010
Springer
15 years 7 months ago
Beyond Process Mining: From the Past to Present and Future
Abstract. Traditionally, process mining has been used to extract models from event logs and to check or extend existing models. This has shown to be useful for improving processes ...
Wil M. P. van der Aalst, Maja Pesic, Minseok Song