1995 search results - page 381 / 399 » What's the Problem |
153
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
123
Voted
IADIS
2008
15 years 4 months ago
2008
One approach to reduce the complexity of the task in the analysis of large scale genome-wide expression is to group the genes showing similar expression patterns into what are cal...
140
Voted
IQ
2007
15 years 4 months ago
2007
: Sufficiently high data quality is crucial for almost every application. Nonetheless, data quality issues are nearly omnipresent. The reasons for poor quality cannot simply be bla...
100
click to vote
ACE
2004
15 years 4 months ago
2004
Over the past decade Australian and New Zealand educational institutions have experienced a rapid increase in the numbers of "New Arrivals" - immigrant and international...
115
click to vote
FLAIRS
2004
15 years 4 months ago
2004
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...