7106 search results - page 787 / 1422 » Restricted Complexity, General Complexity |
187
Voted
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
233
Voted
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Document classification presents difficult challenges due to the sparsity and the high dimensionality of text data, and to the complex semantics of the natural language. The tradi...
310
Voted
POPL
2007
ACM
16 years 7 months ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
340
Voted
POPL
2005
ACM
16 years 7 months ago
2005
ACM
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...
224
Voted
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...