Sciweavers

1369 search results - page 115 / 274
» Lattice computations for random numbers
Sort
View
IJNSEC
2010
151views more  IJNSEC 2010»
13 years 3 months ago
Performance Evaluation of Mobility Speed over MANET Routing Protocols
Ad-hoc networking is a concept in computer communications. Each node participating in the network acts both as host and a router and must therefore is willing to forward packets f...
Yasser Kamal Hassan, Mohamed Hashim Abd El-Aziz, A...
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 9 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 6 months ago
Mining Complex Spatio-Temporal Sequence Patterns.
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
Florian Verhein
TIT
2008
83views more  TIT 2008»
13 years 9 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
ICCTA
2007
IEEE
14 years 28 days ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor