Sciweavers

2917 search results - page 358 / 584
» Satisfying Interaction Constraints
Sort
View
IDA
2005
Springer
16 years 2 days ago
From Local Pattern Mining to Relevant Bi-cluster Characterization
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
Ruggero G. Pensa, Jean-François Boulicaut
VLSM
2005
Springer
16 years 1 days ago
Implicit Free-Form-Deformations for Multi-frame Segmentation and Tracking
Abstract. In this paper, we propose a novel technique to address motion estimation and tracking. Such technique represents the motion field using a regular grid of thin-plate spli...
Konstantinos Karantzalos, Nikos Paragios
SAC
2004
ACM
16 years 51 min ago
A comparison of randomized and evolutionary approaches for optimizing base station site selection
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
Larry Raisanen, Roger M. Whitaker, Steve Hurley
CAAN
2004
Springer
15 years 12 months ago
Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
Sung-woo Cho, Ashish Goel
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 12 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski