Sciweavers

1816 search results - page 237 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
EUROPAR
2004
Springer
15 years 12 months ago
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
Edson Norberto Cáceres, Frank K. H. A. Dehn...
NDSS
2003
IEEE
15 years 11 months ago
Integrating Security, Mobility and Multi-Homing in a HIP Way
The current trend in mobile networking is towards mobile hosts that have multiple network interfaces, e.g., WLAN and GPRS. However, when the current Internet architecture was orig...
Pekka Nikander, Jukka Ylitalo, Jorma Wall
CORR
2010
Springer
150views Education» more  CORR 2010»
15 years 6 months ago
Extraction of Symbolic Rules from Artificial Neural Networks
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...
S. M. Kamruzzaman, Md. Monirul Islam
SIAMIS
2008
116views more  SIAMIS 2008»
15 years 6 months ago
Quantitative Object Reconstruction Using Abel Transform X-Ray Tomography and Mixed Variable Optimization
This paper introduces a new approach to the problem of quantitative reconstruction of an object from few radiographic views. A mixed variable programming problem is formulated in ...
Mark A. Abramson, Thomas J. Asaki, J. E. Dennis, K...
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 6 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...