Sciweavers

3247 search results - page 628 / 650
» Randomized smoothing networks
Sort
View
BMCBI
2010
149views more  BMCBI 2010»
14 years 9 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
BMCBI
2008
122views more  BMCBI 2008»
14 years 9 months ago
Effects of dependence in high-dimensional multiple testing problems
Background: We consider effects of dependence among variables of high-dimensional data in multiple hypothesis testing problems, in particular the False Discovery Rate (FDR) contro...
Kyung In Kim, Mark A. van de Wiel
IJNSEC
2007
204views more  IJNSEC 2007»
14 years 9 months ago
Enhanced DSR for MANET with Improved Secured Route Discovery and QoS
Mobile Ad hoc NETwork (MANET) comprises of nodes, which are free to move randomly, yet cooperate to forward packets between source and destination over a multi-hop wireless networ...
Anil Rawat, Prakash Dattatraya Vyavahare, Ashwani ...
CCR
2005
129views more  CCR 2005»
14 years 9 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
14 years 9 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...