14078 search results - page 2359 / 2816 » Design and Analysis of Computer Algorithms |
177
click to vote
RTCSA
2006
IEEE
16 years 8 days ago
2006
IEEE
In this paper we consider data freshness and overload handling in embedded systems. The requirements on data management and overload handling are derived from an engine control so...
174
click to vote
BIBE
2005
IEEE
15 years 12 months ago
2005
IEEE
Selecting informative genes from microarray experiments is one of the most important data analysis steps for deciphering biological information imbedded in such experiments. Howev...
177
click to vote
MIS
2004
Springer
15 years 11 months ago
2004
Springer
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
174
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
211
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...