1629 search results - page 123 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper presents a novel line-based affine invariant object location methodology. Our algorithm employs a new line-based transformation space decomposition technique to exploit...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
PRICAI
1998
Springer
15 years 2 months ago
1998
Springer
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
DAC
2002
ACM
15 years 11 months ago
2002
ACM
This paper proposes a general hierarchical analysis methodology, HiPRIME, to efficiently analyze RLKC power delivery systems. After partitioning the circuits into blocks, we devel...
BMCBI
2008
14 years 10 months ago
2008
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...