Sciweavers

1722 search results - page 199 / 345
» Variables in Concept Graphs
Sort
View
117
Voted
INFORMS
2010
138views more  INFORMS 2010»
15 years 2 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
CVPR
2003
IEEE
16 years 6 months ago
Nonparametric Belief Propagation
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...
137
Voted
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
16 years 24 days ago
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Lintao Zh...
ADHOCNOW
2009
Springer
15 years 10 months ago
Autonomous Transmission Power Adaptation for Multi-Radio Multi-Channel Wireless Mesh Networks
Multi-Radio Multi-Channel (MRMC) systems are key to power control problems in WMNs. Previous studies have emphasized throughput maximization in such systems as the main design chal...
Thomas O. Olwal, Barend J. van Wyk, Karim Djouani,...
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
15 years 10 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur