Sciweavers

22128 search results - page 4296 / 4426
» Research in Structural Computing
Sort
View
147
Voted
JCM
2007
131views more  JCM 2007»
15 years 3 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
162
Voted
JCP
2007
121views more  JCP 2007»
15 years 3 months ago
p-Trust: A New Model of Trust to Allow Finer Control Over Privacy in Peer-to-Peer Framework
— Every time a user conducts an electronic transaction over the Internet a wealth of personal information is revealed, either voluntarily or involuntarily. This causes serious br...
Sudip Chakraborty, Indrajit Ray
140
Voted
CCR
2005
129views more  CCR 2005»
15 years 3 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft
126
Voted
JMIV
2007
143views more  JMIV 2007»
15 years 3 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
136
Voted
TVCG
2008
147views more  TVCG 2008»
15 years 3 months ago
Interactive Visual Steering - Rapid Visual Prototyping of a Common Rail Injection System
Interactive steering with visualization has been a common goal of the visualization research community for twenty years, but it is rarely ever realized in practice. In this paper w...
Kresimir Matkovic, Denis Gracanin, Mario Jelovic, ...
« Prev « First page 4296 / 4426 Last » Next »