Sciweavers

3359 search results - page 470 / 672
» A Simplified Idea Algorithm
Sort
View
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 10 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
IJON
2008
186views more  IJON 2008»
13 years 10 months ago
Computational analysis and learning for a biologically motivated model of boundary detection
In this work we address the problem of boundary detection by combining ideas and approaches from biological and computational vision. Initially, we propose a simple and efficient ...
Iasonas Kokkinos, Rachid Deriche, Olivier D. Fauge...
CORR
2007
Springer
47views Education» more  CORR 2007»
13 years 10 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 10 months ago
Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
Libin Jiang, Jean C. Walrand
ENTCS
2007
96views more  ENTCS 2007»
13 years 10 months ago
Deduction, Strategies, and Rewriting
Automated deduction methods should be specified not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, di...
Steven Eker, Narciso Martí-Oliet, Jos&eacut...