1046 search results - page 19 / 210 » Approximation Algorithms for Domination Search |
104
Voted
TNN
1998
15 years 4 days ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
TCS
2008
15 years 12 days ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
STOC
2006
ACM
16 years 24 days ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
306
click to vote
ICDE
2008
IEEE
17 years 7 days ago
2008
IEEE
Recently, there has been much interest in processing skyline queries for various applications that include decision making, personalized services, and search pruning. Skyline queri...
80
Voted
DAC
1999
ACM
16 years 1 months ago
1999
ACM
In this paper we present a new algorithm for computing reduced-order models of interconnect which utilizes the dominant controllable subspace of the system. The dominant controlla...