1629 search results - page 123 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
133
click to vote
ICPR
2006
IEEE
16 years 7 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...
162
click to vote
SODA
2004
ACM
15 years 7 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...
184
click to vote
PRICAI
1998
Springer
15 years 10 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...
170
click to vote
DAC
2002
ACM
16 years 7 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...
197
click to vote
BMCBI
2008
15 years 6 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...