Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
Mining association rules is an important technique for discovering meaningful patterns in transaction databases. Many different measures of interestingness have been proposed for ...
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
Abstract. The growing popularity of online social networks gave researchers access to large amount of network data and renewed interest in methods for automatic community detection...