Sciweavers

383 search results - page 35 / 77
» A Bound on the Total Chromatic Number
Sort
View
ISSAC
2005
Springer
110views Mathematics» more  ISSAC 2005»
14 years 3 months ago
Multivariate power series multiplication
We study the multiplication of multivariate power series. We show that over large enough fields, the bilinear complexity of the product modulo a monomial ideal M is bounded by th...
Éric Schost
FLAIRS
2004
13 years 11 months ago
Spatiotemporal Novelty Detection Using Resonance Networks
We present a single-layer recurrent neural network that implements novelty detection for spatiotemporal patterns. The architecture is based on the structure of region CA3 in the h...
Benjamin A. Rowland, Anthony S. Maida
JCP
2006
94views more  JCP 2006»
13 years 10 months ago
Broadcast Encryption Using Probabilistic Key Distribution and Applications
A family of novel broadcast encryption schemes based on probabilistic key pre-distribution are proposed, that enable multiple sources to broadcast secrets, without the use of asymm...
Mahalingam Ramkumar
GD
2004
Springer
14 years 3 months ago
Layouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
Vida Dujmovic, David R. Wood
INFOCOM
2005
IEEE
14 years 4 months ago
Routing in ad hoc networks: a theoretical framework with practical implications
— In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a ...
Nianjun Zhou, Alhussein A. Abouzeid