Sciweavers

600 search results - page 118 / 120
» Problems and results in extremal combinatorics - II
Sort
View
COMCOM
2006
138views more  COMCOM 2006»
13 years 7 months ago
Reducing memory fragmentation in network applications with dynamic memory allocators optimized for performance
The needs for run-time data storage in modern wired and wireless network applications are increasing. Additionally, the nature of these applications is very dynamic, resulting in ...
Stylianos Mamagkakis, Christos Baloukas, David Ati...
BMCBI
2005
100views more  BMCBI 2005»
13 years 7 months ago
Evolutionary models for insertions and deletions in a probabilistic modeling framework
Background: Probabilistic models for sequence comparison (such as hidden Markov models and pair hidden Markov models for proteins and mRNAs, or their context-free grammar counterp...
Elena Rivas
IJON
2002
104views more  IJON 2002»
13 years 6 months ago
Power and the limits of reactive agents
In this paper I will show how reactive agents can solve relatively complex tasks without requiring any internal state and I will demonstrate that this is due to their ability to c...
Stefano Nolfi
VLDB
2002
ACM
120views Database» more  VLDB 2002»
13 years 6 months ago
Improving Data Access of J2EE Applications by Exploiting Asynchronous Messaging and Caching Services
The J2EE platform provides a variety of options for making business data persistent using DBMS technology. However, the integration with existing backend database systems has prov...
Samuel Kounev, Alejandro P. Buchmann
SAC
2008
ACM
13 years 6 months ago
An efficient feature ranking measure for text categorization
A major obstacle that decreases the performance of text classifiers is the extremely high dimensionality of text data. To reduce the dimension, a number of approaches based on rou...
Songbo Tan, Yuefen Wang, Xueqi Cheng