Sciweavers

1085 search results - page 182 / 217
» On the performance of one-to-many data transformations
Sort
View
ICPP
1998
IEEE
13 years 12 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
COMPSAC
2004
IEEE
13 years 11 months ago
Efficient Partial Multiple Periodic Patterns Mining without Redundant Rules
Partial periodic patterns mining is a very interesting domain in data mining problem. In the previous studies, full and partial multiple periodic patterns mining problems are cons...
Wenpo Yang, Guanling Lee
CICLING
2010
Springer
13 years 11 months ago
Adaptive Term Weighting through Stochastic Optimization
Term weighting strongly influences the performance of text mining and information retrieval approaches. Usually term weights are determined through statistical estimates based on s...
Michael Granitzer
CVPR
2007
IEEE
14 years 9 months ago
A Fast 3D Correspondence Method for Statistical Shape Modeling
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In this paper, we address this ...
Pahal Dalal, Brent C. Munsell, Song Wang, Jijun Ta...
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 9 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...