20 search results - page 4 / 4 » Comments on selected fundamental aspects of microarray analy... |
150
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
CBSE
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Searching and subsequently selecting reusable components from component repositories has become a key impediment for not only component-based development but also for ach...
EDOC
2002
IEEE
15 years 4 months ago
2002
IEEE
Collaborations (between objects) are increasingly being recognized as fundamental building blocks to structure object-oriented design, and they have made their way into UML. But v...
CATE
2004
15 years 1 months ago
2004
The role of assessment and evaluation has recently changed in a way which will have fundamental consequences in applying information and communication technologies (ICTs) to analy...
118
click to vote
TPDS
2002
14 years 11 months ago
2002
Distributed dynamic channel allocation (DDCA) is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not e...