3598 search results - page 374 / 720 » New efficient algorithms for computing effective capacitance |
203
Voted
TCSV
2008
15 years 6 months ago
2008
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
189
click to vote
TPDS
2002
15 years 6 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
170
click to vote
ICSAP
2009
15 years 4 months ago
2009
This paper proposed an efficient omnidirectional surveillance system for digital home security. In this surveillance system, the omnidirectional scenes in a room, kitchen, car porc...
287
Voted
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
165
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...