Sciweavers

1195 search results - page 86 / 239
» New constructions of SSPDs and their applications
Sort
View
CIDR
2009
136views Algorithms» more  CIDR 2009»
15 years 7 months ago
The Role of Schema Matching in Large Enterprises
To date, the principal use case for schema matching research has been as a precursor for code generation, i.e., constructing mappings between schema elements with the end goal of ...
Ken Smith, Michael Morse, Peter Mork, Maya Hao Li,...
GLOBECOM
2008
IEEE
15 years 7 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 6 months ago
Optimally Sparse Frames
Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. Howe...
Peter G. Casazza, Andreas Heinecke, Felix Krahmer,...
IANDC
2008
122views more  IANDC 2008»
15 years 6 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
CORR
2007
Springer
52views Education» more  CORR 2007»
15 years 6 months ago
Hierarchical Unambiguity
Abstract. We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to push forward some known constructs involving relativized...
Holger Spakowski, Rahul Tripathi