Sciweavers

1998 search results - page 366 / 400
» Complexity of the Cover Polynomial
Sort
View
ICDM
2008
IEEE
401views Data Mining» more  ICDM 2008»
14 years 4 months ago
Graph OLAP: Towards Online Analytical Processing on Graphs
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han, Phil...
P2P
2008
IEEE
102views Communications» more  P2P 2008»
14 years 4 months ago
Free-Riding, Fairness, and Firewalls in P2P File-Sharing
Peer-to-peer file-sharing networks depend on peers uploading data to each other. Some peers, called free-riders, will not upload data unless there is an incentive to do so. Algor...
Jacob Jan-David Mol, Johan A. Pouwelse, Dick H. J....
SACRYPT
2007
Springer
141views Cryptology» more  SACRYPT 2007»
14 years 4 months ago
Analysis of Countermeasures Against Access Driven Cache Attacks on AES
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
Johannes Blömer, Volker Krummel
ICAS
2006
IEEE
171views Robotics» more  ICAS 2006»
14 years 3 months ago
Adaptive Approach to Information Dissemination in Self-Organizing Grids
The size, complexity, heterogeneity, and dynamism of largescale computational grids make autonomic grid services and solutions necessary. In particular, grid schedulers must map a...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...
ASPDAC
2006
ACM
116views Hardware» more  ASPDAC 2006»
14 years 3 months ago
A robust detailed placement for mixed-size IC designs
— The rapid increase in IC design complexity and wide-spread use of intellectual-property (IP) blocks have made the so-called mixed-size placement a very important topic in recen...
Jason Cong, Min Xie