Sciweavers

23201 search results - page 4232 / 4641
» Rewriting Systems with Data
Sort
View
CORR
2007
Springer
138views Education» more  CORR 2007»
15 years 6 months ago
On the Performance Evaluation of Encounter-based Worm Interactions Based on Node Characteristics
An encounter-based network is a frequently-disconnected wireless ad-hoc network requiring nearby neighbors to store and forward data utilizing mobility and encounters over time. U...
Sapon Tanachaiwiwat, Ahmed Helmy
IS
2006
15 years 6 months ago
Granularity reduction in temporal document databases
With rapidly decreasing storage costs, temporal document databases are now a viable solution in many contexts. However, storing an ever-growing database can still be too costly, a...
Kjetil Nørvåg
ITSSA
2006
116views more  ITSSA 2006»
15 years 6 months ago
A Genetic Programming Approach to Automated Test Generation for Object-Oriented Software
: This article proposes a new method for creating test software for object-oriented systems using a genetic programming approach. It is believed that this approach is advantageous ...
Arjan Seesing, Hans-Gerhard Groß
JMM2
2008
92views more  JMM2 2008»
15 years 6 months ago
Dimensionality Reduction using SOM based Technique for Face Recognition
Unsupervised or Self-Organized learning algorithms have become very popular for discovery of significant patterns or features in the input data. The three prominent algorithms name...
Dinesh Kumar, C. S. Rai, Shakti Kumar
JCST
2006
65views more  JCST 2006»
15 years 6 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
« Prev « First page 4232 / 4641 Last » Next »