Sciweavers

1693 search results - page 53 / 339
» fast 2008
Sort
View
TCAD
2008
119views more  TCAD 2008»
13 years 8 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
TKDE
1998
102views more  TKDE 1998»
13 years 8 months ago
Fast and Effective Retrieval of Medical Tumor Shapes
—We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes (“Find tumors that are similar to a given patter...
Flip Korn, Nikolaos Sidiropoulos, Christos Falouts...
TNN
1998
85views more  TNN 1998»
13 years 8 months ago
Fast numerical integration of relaxation oscillator networks based on singular limit solutions
—Relaxation oscillations exhibiting more than one time scale arise naturally from many physical systems. When relaxation oscillators are coupled in a way that resembles chemical ...
P. S. Linsay, DeLiang L. Wang
IVC
2007
142views more  IVC 2007»
13 years 8 months ago
Fast stochastic optimization for articulated structure tracking
Recently, an optimization approach for fast visual tracking of articulated structures based on Stochastic Meta-Descent (SMD) [7] has been presented. SMD is a gradient descent with...
Matthieu Bray, Esther Koller-Meier, Nicol N. Schra...
IVS
2007
140views more  IVS 2007»
13 years 8 months ago
Fast point-feature label placement for dynamic visualizations
This paper describes a fast approach to automatic point label de-confliction on interactive maps. The general Map Labeling problem is NP-hard and has been the subject of much stud...
Kevin Mote