Sciweavers

8259 search results - page 1426 / 1652
» On Generalized Feistel Networks
Sort
View
IM
2008
15 years 7 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
CN
2007
77views more  CN 2007»
15 years 7 months ago
Secure many-to-one symbol transmission for implementation on smart cards
Multicast communication is arguably the most promising paradigm to enable mass Internet transmission of live events, or any other content sent on the network from a single source ...
Francesc Sebé, Alexandre Viejo, Josep Domin...
COR
2007
108views more  COR 2007»
15 years 7 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
CORR
2007
Springer
127views Education» more  CORR 2007»
15 years 7 months ago
Attribute Exploration of Discrete Temporal Transitions
Discrete temporal transitions occur in a variety of domains, but this work is mainly motivated by applications in molecular biology: explaining and analyzing observed transcriptome...
Johannes Wollbold
CORR
2007
Springer
144views Education» more  CORR 2007»
15 years 7 months ago
Distributing the Kalman Filter for Large-Scale Systems
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
Usman A. Khan, José M. F. Moura
« Prev « First page 1426 / 1652 Last » Next »