134 search results - page 21 / 27 » On Constant Time Approximation of Parameters of Bounded Degr... |
150
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
165
click to vote
FUZZIEEE
2007
IEEE
15 years 12 months ago
2007
IEEE
The algorithm of on-line predictor from input-output data pairs will be proposed. In this paper, it proposed an approach to generate fuzzy rules of predictor from real-time input-o...
203
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
195
click to vote
SPAA
1999
ACM
15 years 10 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
165
click to vote
ICDCS
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...