Sciweavers

1478 search results - page 55 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
EUROCRYPT
2006
Springer
14 years 19 days ago
VSH, an Efficient and Provable Collision-Resistant Hash Function
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
Scott Contini, Arjen K. Lenstra, Ron Steinfeld
CIDR
2003
123views Algorithms» more  CIDR 2003»
13 years 10 months ago
Managing Expressions as Data in Relational Database Systems
A wide-range of applications, including Publish/Subscribe, Workflow, and Web-site Personalization, require maintaining user’s interest in expected data as conditional expression...
Aravind Yalamanchi, Jagannathan Srinivasan, Dieter...
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 3 months ago
Recommending Join Queries via Query Log Analysis
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
Xiaoyan Yang, Cecilia M. Procopiuc, Divesh Srivast...
OSDI
2006
ACM
14 years 9 months ago
Operating System Profiling via Latency Analysis
Operating systems are complex and their behavior depends on many factors. Source code, if available, does not directly help one to understand the OS's behavior, as the behavi...
Nikolai Joukov, Avishay Traeger, Rakesh Iyer, Char...
IRI
2007
IEEE
14 years 3 months ago
Enhancing Text Analysis via Dimensionality Reduction
Many applications require analyzing vast amounts of textual data, but the size and inherent noise of such data can make processing very challenging. One approach to these issues i...
David G. Underhill, Luke McDowell, David J. Marche...