Sciweavers

9849 search results - page 89 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
ICIP
2009
IEEE
16 years 5 months ago
A Graph-cut Based Algorithm For Approximate Mrf Optimization
This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques...
IWNAS
2006
IEEE
15 years 10 months ago
Comparisons of Three Kalman Filter Tracking Algorithms in Sensor Network
This paper compares extended Kalman filters with the P, PV and PVA dynamics models for object tracking in wireless network. Experiments shows that PVA achieves the best and P per...
Yifeng Zhu, Ali Shareef
ASPDAC
1995
ACM
77views Hardware» more  ASPDAC 1995»
15 years 7 months ago
A scheduling algorithm for synthesis of bus-partitioned architectures
- Due to efficient interconnect structure and internal parallelism bus-partitioned architectures are very beneficial for sub-micron chip design. This paper presents a new approach ...
Vasily G. Moshnyaga, Fumiaki Ohbayashi, Keikichi T...
CORR
2009
Springer
114views Education» more  CORR 2009»
15 years 2 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol
IEAAIE
2009
Springer
15 years 2 months ago
Plan Repair in Conflict-Free Routing
In conflict-free routing a set of agents have to traverse a common infrastructure without interfering with each other. Maza and Castagna [1] showed how route plans can be repaired ...
Adriaan ter Mors, Cees Witteveen