Sciweavers

1096 search results - page 11 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
BIBE
2007
IEEE
134views Bioinformatics» more  BIBE 2007»
15 years 4 months ago
Bottom-Up Multiple Row Addition Algorithms for the Biclustering-Problem
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...
Hyung-Won Koh, Lars Hildebrand
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
COMAD
2009
14 years 10 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
INFOCOM
2006
IEEE
15 years 3 months ago
A Compound TCP Approach for High-Speed and Long Distance Networks
—Many applications require fast data transfer over high speed and long distance networks. However, standard TCP fails to fully utilize the network capacity due to the limitation ...
Kun Tan, Jingmin Song, Qian Zhang, Murari Sridhara...
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 4 months ago
Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS
Markov Logic Networks (MLNs) have emerged as a powerful framework that combines statistical and logical reasoning; they have been applied to many data intensive problems including...
Feng Niu, Christopher Ré, AnHai Doan, Jude ...