Sciweavers

419 search results - page 68 / 84
» Constraint models for graceful graphs
Sort
View
CLA
2007
13 years 8 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
ATS
2003
IEEE
131views Hardware» more  ATS 2003»
14 years 1 days ago
Software-Based Delay Fault Testing of Processor Cores
Software-based self-testing is a promising approach for the testing of processor cores which are embedded inside a System-on-a-Chip (SoC), as it can apply test vectors in function...
Virendra Singh, Michiko Inoue, Kewal K. Saluja, Hi...
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 6 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
DASFAA
2011
IEEE
311views Database» more  DASFAA 2011»
12 years 10 months ago
3D Indoor Route Planning for Arbitrary-Shape Objects
Route planning, which is used to calculate feasible routes in a given environment, is one of the key issues in navigation systems. According to different constraints in different...
Wenjie Yuan, Markus Schneider
INFOCOM
2005
IEEE
14 years 10 days ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...