1071 search results - page 187 / 215 » An analysis framework for search sequences |
114
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
IFIP
2000
Springer
15 years 1 months ago
2000
Springer
Many researchers have searched for evidence of organizational improvements from the huge sums invested in ICT. Unfortunately, evidence for such a pay back is spotty at best (e.g.,...
AROBOTS
2007
14 years 10 months ago
2007
— A team of small, low-cost robots instead of a single large, complex robot is useful in operations such as search and rescue, urban exploration etc. However, the performance of ...
109
click to vote
BMCBI
2008
14 years 9 months ago
2008
Background: Recent genome wide transcription factor binding site or chromatin modification mapping analysis techniques, such as chromatin immunoprecipitation (ChIP) linked to DNA ...