Sciweavers

13376 search results - page 484 / 2676
» Problem Solving with
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 6 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang
ACCV
2007
Springer
16 years 15 days ago
Visual Odometry for Non-overlapping Views Using Second-Order Cone Programming
Abstract. We present a solution for motion estimation for a set of cameras which are firmly mounted on a head unit and do not have overlapping views in each image. This problem re...
Jae-Hak Kim, Richard I. Hartley, Jan-Michael Frahm...
EAAI
2010
107views more  EAAI 2010»
15 years 1 months ago
Honey bee social foraging algorithms for resource allocation: Theory and application
A model of honey bee social foraging is introduced to create an algorithm that solves a class of optimal resource allocation problems. We prove that if several such algorithms (&q...
Nicanor Quijano, Kevin M. Passino
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
13 years 8 months ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman
ACST
2006
15 years 7 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara