Sciweavers

1963 search results - page 231 / 393
» The Maximum Solution Problem on Graphs
Sort
View
92
Voted
MST
2010
107views more  MST 2010»
14 years 11 months ago
Fixed-Parameter Algorithms for Cluster Vertex Deletion
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
Falk Hüffner, Christian Komusiewicz, Hannes M...
CORR
2006
Springer
85views Education» more  CORR 2006»
15 years 24 days ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
JCO
2006
106views more  JCO 2006»
15 years 22 days ago
Reliable Ad Hoc Routing Based on Mobility Prediction
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
Jian Tang, Guoliang Xue, Weiyi Zhang
ICCAD
2006
IEEE
108views Hardware» more  ICCAD 2006»
15 years 9 months ago
Soft error reduction in combinational logic using gate resizing and flipflop selection
Soft errors in logic are emerging as a significant reliability problem for VLSI designs. This paper presents novel circuit optimization techniques to mitigate soft error rates (SE...
Rajeev R. Rao, David Blaauw, Dennis Sylvester
ICPR
2006
IEEE
16 years 1 months ago
Object Localization Using Input/Output Recursive Neural Networks
Localizing objects in images is a difficult task and represents the first step to the solution of the object recognition problem. This paper presents a novel approach to the local...
Lorenzo Sarti, Marco Maggini, Monica Bianchini