Sciweavers

2657 search results - page 427 / 532
» On the complexity of hierarchical problem solving
Sort
View
INFOCOM
2006
IEEE
15 years 4 months ago
Session Privacy Enhancement by Traffic Dispersion
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
Haim Zlatokrilov, Hanoch Levy
SENSYS
2003
ACM
15 years 3 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
14 years 12 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
AAAI
1990
14 years 11 months ago
The Design of a Marker Passing Architecture for Knowledge Processing
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
Wing Lee, Dan I. Moldovan
ALMOB
2006
138views more  ALMOB 2006»
14 years 10 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh