Sciweavers

6365 search results - page 44 / 1273
» Fast Local Computation Algorithms
Sort
View
ICIP
2003
IEEE
16 years 2 months ago
Robust object boundary determination using a locally adaptive level set algorithm
This paper introduces a level set methodology for the precise boundary localization of image objects within an indicated region, designed to be particularly robust against weak or...
Eftychios Sifakis, George Tziritas
JAIR
2006
179views more  JAIR 2006»
15 years 15 days ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
114
Voted
DAC
2005
ACM
15 years 2 months ago
Partitioning-based approach to fast on-chip decap budgeting and minimization
This paper proposes a fast decoupling capacitance (decap) allocation and budgeting algorithm for both early stage decap estimation and later stage decap minimization in today’s ...
Hang Li, Zhenyu Qi, Sheldon X.-D. Tan, Lifeng Wu, ...
BMCBI
2010
218views more  BMCBI 2010»
15 years 19 days ago
Fast multi-core based multimodal registration of 2D cross-sections and 3D datasets
Background: Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve...
Michael Scharfe, Rainer Pielot, Falk Schreiber
117
Voted
BMCBI
2010
151views more  BMCBI 2010»
15 years 19 days ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon