Sciweavers

16257 search results - page 2993 / 3252
» D-finiteness: algorithms and applications
Sort
View
DIALM
2007
ACM
131views Algorithms» more  DIALM 2007»
15 years 10 months ago
Dessy: Towards Flexible Mobile Desktop Search
In the near future, mobile devices are expected to have a storage capacity comparable to today's desktop machines. As the amount of infomation grows, conventional search tool...
Eemil Lagerspetz, Tancred Lindholm, Sasu Tarkoma
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 10 months ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
15 years 10 months ago
New perspectives and methods in link prediction
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse network...
Ryan Lichtenwalter, Jake T. Lussier, Nitesh V. Cha...
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
15 years 10 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 10 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
« Prev « First page 2993 / 3252 Last » Next »