1594 search results - page 207 / 319 » An Algorithm to Compute Collusion Paths |
125
Voted
ICDM
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
126
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
113
click to vote
JCDCG
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
140
click to vote
CSL
2003
Springer
15 years 8 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
137
click to vote
EUROMICRO
2004
IEEE
15 years 7 months ago
2004
IEEE
A primary goal in the design of wireless sensor networks is lifetime maximization, constrained by the energy capacity of batteries. One well known method to reduce energy consumpt...