Sciweavers

1940 search results - page 331 / 388
» Graph Transformation with Variables
Sort
View
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 4 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
AI
1999
Springer
15 years 4 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
MP
2010
99views more  MP 2010»
15 years 3 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
PAMI
2010
174views more  PAMI 2010»
15 years 3 months ago
Image Segmentation with a Unified Graphical Model
—We propose a unified graphical model that can represent both the causal and noncausal relationships among random variables and apply it to the image segmentation problem. Specif...
Lei Zhang 0011, Qiang Ji
161
Voted
TON
2010
158views more  TON 2010»
15 years 3 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...