Sciweavers

389 search results - page 36 / 78
» Computational Alternatives to Random Number Generators
Sort
View
PAMI
2007
176views more  PAMI 2007»
13 years 7 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
VLSID
2006
IEEE
240views VLSI» more  VLSID 2006»
14 years 8 months ago
An Efficient and Accurate Logarithmic Multiplier Based on Operand Decomposition
Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal process...
Venkataraman Mahalingam, N. Ranganathan
BMCBI
2011
13 years 2 months ago
Simulated evolution applied to study the genetic code optimality using a model of codon reassignments
Background: As the canonical code is not universal, different theories about its origin and organization have appeared. The optimization or level of adaptation of the canonical ge...
Jose Santos, Ángel Monteagudo
CVPR
2011
IEEE
13 years 4 months ago
Variable Grouping for Energy Minimization
This paper addresses the problem of efficiently solving large-scale energy minimization problems encountered in computer vision. We propose an energy-aware method for merging ran...
Taesup Kim, Sebastian Nowozin, Pushmeet Kohli, Cha...
ICWN
2007
13 years 9 months ago
Comparing Agent Paradigms for Resource Management in Sensor Networks
— Management of power and other resources that effect field life is an important consideration in sensor networks. This paper presents and compares alternative agent paradigms ap...
Anish Anthony, Thomas C. Jannett