5606 search results - page 239 / 1122 » Randomization Techniques for Graphs. |
WSC
2007
15 years 3 months ago
2007
Models of real world systems are being increasingly generated from data that describes the behaviour of systems. Data mining techniques, such as Artificial Neural Networks (ANN),...
165
click to vote
TCAD
2010
14 years 7 months ago
2010
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
111
click to vote
WAW
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
119
click to vote
ECML
2004
Springer
15 years 6 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
105
Voted
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
-In order to implement a continuous and robust dynamic localization of a mobile robot, the fusion of dead reckoning and absolute sensors is often used. Depending on the objectives ...