Sciweavers

3702 search results - page 408 / 741
» All Pairings Are in a Group
Sort
View
TELSYS
2002
73views more  TELSYS 2002»
15 years 6 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
TMI
2002
155views more  TMI 2002»
15 years 6 months ago
Active Shape Model Segmentation with Optimal Features
Abstract--An active shape model segmentation scheme is presented that is steered by optimal local features, contrary to normalized first order derivative profiles, as in the origin...
Bram van Ginneken, Alejandro F. Frangi, Joes Staal...
MJ
2007
87views more  MJ 2007»
15 years 6 months ago
Using SAT-based techniques in power estimation
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
Assim Sagahyroon, Fadi A. Aloul
NETWORKS
2007
15 years 6 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
179
Voted
NETWORKS
2007
15 years 6 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei