Sciweavers

4231 search results - page 797 / 847
» Using Language More Responsibly
Sort
View
152
Voted
DAC
2011
ACM
14 years 2 months ago
Extracting behavior and dynamically generated hierarchy from SystemC models
SystemC is a popular modeling language which can be used to specify systems at bstraction level. Currently, SystemC tools can not cope with SystemC models for which the module hie...
Harry Broeders, René van Leuken
242
Voted
CP
2009
Springer
16 years 3 months ago
Coalition Structure Generation Utilizing Compact Characteristic Function Representations
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko S...
125
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 3 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
122
Voted
KDD
2004
ACM
192views Data Mining» more  KDD 2004»
16 years 3 months ago
Mining and summarizing customer reviews
Merchants selling products on the Web often ask their customers to review the products that they have purchased and the associated services. As e-commerce is becoming more and mor...
Minqing Hu, Bing Liu
129
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 2 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine