1632 search results - page 102 / 327 » Sublinear Time Algorithms for Metric Space Problems |
122
Voted
ASPDAC
2001
ACM
15 years 7 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
133
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
115
Voted
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper we discuss the feasibility of using singular points in a scale space representation (referred to as top points) for image matching purposes. These points are easily ...
136
Voted
COMCOM
1998
15 years 3 months ago
1998
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
275
Voted
GECCO
2011
Springer
14 years 7 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...