Sciweavers

1093 search results - page 32 / 219
» Fast Abstracts
Sort
View
112
Voted
BMCBI
2010
149views more  BMCBI 2010»
15 years 16 days ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
90
Voted
IOR
2007
89views more  IOR 2007»
15 years 10 days ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
121
Voted
ACCV
2006
Springer
15 years 6 months ago
Fast Global Motion Estimation Via Iterative Least-Square Method
Abstract. This paper presents a fast algorithm for global motion estimation based on Iterative Least- Square Estimation (ILSE) technique. Compared with the traditional framework, t...
Jia Wang, Haifeng Wang, Qingshan Liu, Hanqing Lu
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
15 years 5 months ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...
TCAD
2008
119views more  TCAD 2008»
15 years 10 days 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