4066 search results - page 636 / 814 » Almost Complete Sets |
228
click to vote
TREC
2007
15 years 8 months ago
2007
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...
189
click to vote
WICSA
2007
15 years 8 months ago
2007
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...
208
click to vote
ALENEX
2009
15 years 8 months ago
2009
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...
236
Voted
CAISE
2010
Springer
15 years 8 months ago
2010
Springer
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 ...
209
click to vote
CCCG
2009
15 years 8 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...