Sciweavers

6575 search results - page 647 / 1315
» Specializing visualization algorithms
Sort
View
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
16 years 1 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 11 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
CVPR
2010
IEEE
15 years 10 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
WALCOM
2007
IEEE
151views Algorithms» more  WALCOM 2007»
15 years 8 months ago
Base Station Placement Problem on the Boundary of a Convex Region
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. ...
213
Voted
BMCBI
2008
129views more  BMCBI 2008»
15 years 7 months ago
A unified approach to false discovery rate estimation
Background: False discovery rate (FDR) methods play an important role in analyzing highdimensional data. There are two types of FDR, tail area-based FDR and local FDR, as well as ...
Korbinian Strimmer