Sciweavers

3204 search results - page 182 / 641
» The Alcuin Number of a Graph
Sort
View
DAC
2009
ACM
14 years 9 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
PERCOM
2006
ACM
14 years 8 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece
GLOBECOM
2007
IEEE
14 years 2 months ago
Using Type-of-Relationship (ToR) Graphs to Select Disjoint Paths in Overlay Networks
— Routing policies used in the Internet can be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid ro...
Sameer Qazi, Tim Moors
IBPRIA
2007
Springer
14 years 2 months ago
Bayesian Oil Spill Segmentation of SAR Images Via Graph Cuts
Abstract. This paper extends and generalizes the Bayesian semisupervised segmentation algorithm [1] for oil spill detection using SAR images. In the base algorithm on which we buil...
Sónia Pelizzari, José M. Bioucas-Dia...
INFOCOM
2006
IEEE
14 years 2 months ago
Sampling Techniques for Large, Dynamic Graphs
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...