Sciweavers

4110 search results - page 236 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
IANDC
2006
86views more  IANDC 2006»
15 years 6 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
ICPR
2006
IEEE
16 years 7 months ago
An Efficient Features - Based License Plate Localization Method
This paper presents a feature-based license plate localization algorithm that copes with multi-object problem in different image capturing conditions. The proposed algorithm is ro...
Hamid Mahini, Shohreh Kasaei, Faezeh Dorri, Fateme...
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
CGF
2008
227views more  CGF 2008»
15 years 6 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
15 years 7 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount