Sciweavers

4047 search results - page 534 / 810
» The Discrete Basis Problem
Sort
View
TSMC
1998
78views more  TSMC 1998»
15 years 4 months ago
Automata learning and intelligent tertiary searching for stochastic point location
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
B. John Oommen, Govindachari Raghunath
NETWORKS
2007
15 years 4 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
PAMI
2007
176views more  PAMI 2007»
15 years 4 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
CN
2008
106views more  CN 2008»
15 years 3 months ago
Optimization models and methods for planning wireless mesh networks
In this paper novel optimization models are proposed for planning Wireless Mesh Networks (WMNs), where the objective is to minimize the network installation cost while providing f...
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Ila...
IJAR
2010
91views more  IJAR 2010»
15 years 3 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens