Sciweavers

20 search results - page 4 / 4
» Comments on selected fundamental aspects of microarray analy...
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 5 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
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...
Songrit Maneewongvatana, David M. Mount
CBSE
2005
Springer
13 years 11 months ago
Finding a Needle in the Haystack: A Technique for Ranking Matches Between Components
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...
Naiyana Tansalarak, Kajal T. Claypool
EDOC
2002
IEEE
13 years 10 months ago
An Architecture and a Process for Implementing Distributed Collaborations
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...
Eric Cariou, Antoine Beugnard, Jean-Marc Jé...
CATE
2004
133views Education» more  CATE 2004»
13 years 6 months ago
Semi-Automatic Evaluation Features in Computer-assisted Essay Assessment
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...
Tuomo Kakkonen, Niko Myller, Erkki Sutinen
TPDS
2002
97views more  TPDS 2002»
13 years 5 months ago
On Distributed Dynamic Channel Allocation in Mobile Cellular Networks
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...
Jianping Jiang, Ten-Hwang Lai, Neelam Soundarajan