Sciweavers

1458 search results - page 206 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
ICFP
2001
ACM
16 years 5 months ago
Recursive Structures for Standard ML
Standard ML is a statically typed programming language that is suited for the construction of both small and large programs. "Programming in the small" is captured by St...
Claudio V. Russo
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
16 years 5 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
237
Voted
ICDE
2008
IEEE
136views Database» more  ICDE 2008»
16 years 6 months ago
Validating Multi-column Schema Matchings by Type
Validation of multi-column schema matchings is essential for successful database integration. This task is especially difficult when the databases to be integrated contain little o...
Bing Tian Dai, Nick Koudas, Divesh Srivastava, Ant...
148
Voted
ICASSP
2008
IEEE
15 years 11 months ago
A study of using locality preserving projections for feature extraction in speech recognition
This paper presents a new approach to feature analysis in automatic speech recognition (ASR) based on locality preserving projections (LPP). LPP is a manifold based dimensionality...
Yun Tang, Richard Rose
133
Voted
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
15 years 9 months ago
Schema Mapping in P2P Networks Based on Classification and Probing
In this paper, we address the problems of adaptive schema mappings between different peers in peer-to-peer network and searching for interesting data residing at different peers ba...
Guoliang Li, Beng Chin Ooi, Bei Yu, Lizhu Zhou