Sciweavers

1547 search results - page 106 / 310
» Randomized Variable Elimination
Sort
View
WAIFI
2007
Springer
127views Mathematics» more  WAIFI 2007»
15 years 9 months ago
The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic
We propose a simple and efficient deterministic extractor for the (hyper)elliptic curve C, defined over Fq2 , where q is some power of an odd prime. Our extractor, for a given poi...
Reza Rezaeian Farashahi, Ruud Pellikaan
SAT
2005
Springer
124views Hardware» more  SAT 2005»
15 years 8 months ago
An Improved Upper Bound for SAT
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
Evgeny Dantsin, Alexander Wolpert
JSAT
2006
119views more  JSAT 2006»
15 years 3 months ago
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. This algorithm uses the clauseshorte...
Evgeny Dantsin, Alexander Wolpert
ICCV
2011
IEEE
14 years 3 months ago
Are Spatial and Global Constraints Really Necessary for Segmentation?
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
Aurelien Lucchi, Yunpeng Li, Xavier Boix, Kevin Sm...
ICEIS
2009
IEEE
15 years 10 months ago
A Service Composition Framework for Decision Making under Uncertainty
Proposed and developed is a service composition framework for decision-making under uncertainty, which is applicable to stochastic optimization of supply chains. Also developed is ...
Malak Al-Nory, Alexander Brodsky, Hadon Nash