Sciweavers

1999 search results - page 342 / 400
» Finding Reductions Automatically
Sort
View
COMAD
2009
15 years 27 days 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
CONEXT
2009
ACM
15 years 27 days ago
Greening the internet with nano data centers
Motivated by increased concern over energy consumption in modern data centers, we propose a new, distributed computing platform called Nano Data Centers (NaDa). NaDa uses ISP-cont...
Vytautas Valancius, Nikolaos Laoutaris, Laurent Ma...
BPM
2010
Springer
128views Business» more  BPM 2010»
15 years 2 hour ago
Content-Aware Resolution Sequence Mining for Ticket Routing
Ticket routing is key to the efficiency of IT problem management. Due to the complexity of many reported problems, problem tickets typically need to be routed among various expert ...
Peng Sun, Shu Tao, Xifeng Yan, Nikos Anerousis, Yi...
SAC
2010
ACM
15 years 1 hour ago
Efficient mapping and voltage islanding technique for energy minimization in NoC under design constraints
Voltage islanding technique in Network-on-Chip (NoC) can significantly reduce the computational energy consumption by scaling down the voltage levels of the processing elements (P...
Pavel Ghosh, Arunabha Sen
BMCBI
2010
178views more  BMCBI 2010»
14 years 12 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...