Sciweavers

520 search results - page 72 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
CSB
2005
IEEE
126views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Identifying Simple Discriminatory Gene Vectors with an Information Theory Approach
In the feature selection of cancer classification problems, many existing methods consider genes individually by choosing the top genes which have the most significant signal-to...
Zheng Yun, Kwoh Chee Keong
COCOON
2005
Springer
14 years 2 months ago
Construction of Scale-Free Networks with Partial Information
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
13 years 10 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin
ICCAD
2002
IEEE
124views Hardware» more  ICCAD 2002»
14 years 5 months ago
Symbolic pointer analysis
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
Jianwen Zhu
DAGM
2010
Springer
13 years 9 months ago
Gaussian Mixture Modeling with Gaussian Process Latent Variable Models
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
Hannes Nickisch, Carl Edward Rasmussen