1995 search results - page 162 / 399 » From Data Flow Networks to Process Algebras |
152
click to vote
CN
2006
15 years 6 months ago
2006
Large-scale sensor networks impose energy and communication constraints, thus it is difficult to collect data from each individual sensor node and process it at the sink. In this ...
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up t...
160
click to vote
SIGMOD
2002
ACM
15 years 5 months ago
2002
ACM
During 2001, the Enterprise Engineering Laboratory at George Mason University was contracted by the Boeing Company to develop an eHub capability for aerospace suppliers in Taiwan....
162
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper proposes a set of affine invariant features (AIFs) for sequence data. The proposed AIFs can be calculated directly from the sequence data, and their invariance to af...
170
click to vote
IPPS
2006
IEEE
16 years 9 days ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...