Sciweavers

16257 search results - page 2971 / 3252
» D-finiteness: algorithms and applications
Sort
View
IWCMC
2006
ACM
16 years 22 days ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
MM
2006
ACM
189views Multimedia» more  MM 2006»
16 years 22 days ago
Real-time computerized annotation of pictures
Automated annotation of digital pictures has been a highly challenging problem for computer scientists since the invention of computers. The capability of annotating pictures by c...
Jia Li, James Ze Wang
SAC
2006
ACM
16 years 22 days ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 22 days ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
16 years 12 days ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
« Prev « First page 2971 / 3252 Last » Next »