Sciweavers

3341 search results - page 453 / 669
» On Bounded Queries and Approximation
Sort
View
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
16 years 8 months ago
Group Linkage
Poor quality data is prevalent in databases due to a variety of reasons, including transcription errors, lack of standards for recording database fields, etc. To be able to query ...
Byung-Won On, Nick Koudas, Dongwon Lee, Divesh Sri...
ICDT
2005
ACM
131views Database» more  ICDT 2005»
16 years 3 days ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
ACNS
2011
Springer
254views Cryptology» more  ACNS 2011»
14 years 10 months ago
Linear Analysis of Reduced-Round CubeHash
Abstract. Recent developments in the field of cryptanalysis of hash functions has inspired NIST to announce a competition for selecting a new cryptographic hash function to join t...
Tomer Ashur, Orr Dunkelman
OOPSLA
2005
Springer
16 years 2 days ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
CIKM
2010
Springer
15 years 5 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...