Sciweavers

4850 search results - page 224 / 970
» Approximate Data Structures with Applications
Sort
View
RIDE
2002
IEEE
15 years 11 months ago
Extensible Data Management in the Middle-Tier
Current data management solutions are largely optimized for intra-enterprise, client-server applications. They depend on predictability, predefined structure, and universal admini...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...
IAJIT
2008
123views more  IAJIT 2008»
15 years 6 months ago
Vectorial Information Structuring for Documents Filtering and Diffusion
: Information retrieval tries to identify relevant documents for an information need. The problems that an IR system should deal with include document indexing (which tries to extr...
Omar Nouali, Abdelghani Krinah
ICCAD
1994
IEEE
74views Hardware» more  ICCAD 1994»
15 years 10 months ago
Non-scan design-for-testability of RT-level data paths
- This paper presents a non-scan design-for-testability technique applicable to register-transfer(RT) level data path circuits, which are usually very hard-to-test due to the prese...
Sujit Dey, Miodrag Potkonjak
CVPR
2004
IEEE
16 years 8 months ago
Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
Kun Huang, René Vidal, Yi Ma
ICDE
2002
IEEE
121views Database» more  ICDE 2002»
16 years 7 months ago
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
Sergey Melnik, Hector Garcia-Molina, Erhard Rahm