Sciweavers

1816 search results - page 97 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
AIPS
2008
15 years 8 months ago
CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...
Blaine Nelson, T. K. Satish Kumar
BIBE
2007
IEEE
134views Bioinformatics» more  BIBE 2007»
16 years 11 days ago
Bottom-Up Multiple Row Addition Algorithms for the Biclustering-Problem
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...
Hyung-Won Koh, Lars Hildebrand
ICIP
2006
IEEE
16 years 7 months ago
Knowledge-Based Supervised Learning Methods in a Classical Problem of Video Object Tracking
In this paper we present a new scheme for detection and tracking of specific objects in a knowledge-based framework. The scheme uses a supervised learning method: Support Vector M...
Lionel Carminati, Jenny Benois-Pineau, Christian J...
ICCV
2011
IEEE
14 years 6 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
EOR
2007
97views more  EOR 2007»
15 years 6 months ago
Using pattern matching for tiling and packing problems
act 12 This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be 13 considered as a special case of bin packing. In the pr...
Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fat...