Sciweavers

56 search results - page 5 / 12
» Improving the Efficiency of the Proxel Method by Using Indiv...
Sort
View
CIKM
2006
Springer
13 years 11 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
ICALP
2009
Springer
14 years 8 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 7 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...
JSS
2007
67views more  JSS 2007»
13 years 7 months ago
TFRP: An efficient microaggregation algorithm for statistical disclosure control
Recently, the issue of Statistic Disclosure Control (SDC) has attracted much attention. SDC is a very important part of data security dealing with the protection of databases. Micr...
Chin-Chen Chang, Yu-Chiang Li, Wen-Hung Huang
GLVLSI
2003
IEEE
202views VLSI» more  GLVLSI 2003»
14 years 27 days ago
System level design of real time face recognition architecture based on composite PCA
Design and implementation of a fast parallel architecture based on an improved principal component analysis (PCA) method called Composite PCA suitable for real-time face recogniti...
Rajkiran Gottumukkal, Vijayan K. Asari