1096 search results - page 32 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
147
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
DAC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— Scene registration of 3D laser rangefinder scans is increasingly being required in applications, such as mobile robotics, that demand a timely response. For speeding up point ...
AAECC
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...