Sciweavers

633 search results - page 52 / 127
» A Few Constructions on Constructors
Sort
View
PLDI
2012
ACM
13 years 4 months ago
Effective parallelization of loops in the presence of I/O operations
Software-based thread-level parallelization has been widely studied for exploiting data parallelism in purely computational loops to improve program performance on multiprocessors...
Min Feng, Rajiv Gupta, Iulian Neamtiu
ICDE
2012
IEEE
238views Database» more  ICDE 2012»
13 years 4 months ago
Mining Knowledge from Data: An Information Network Analysis Approach
Abstract—Most objects and data in the real world are interconnected, forming complex, heterogeneous but often semistructured information networks. However, many database research...
Jiawei Han, Yizhou Sun, Xifeng Yan, Philip S. Yu
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
15 years 11 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
IMA
2009
Springer
139views Cryptology» more  IMA 2009»
15 years 8 months ago
Security of Cyclic Double Block Length Hash Functions
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
ICALP
2010
Springer
15 years 6 months ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff