Sciweavers

820 search results - page 153 / 164
» Finding low-utility data structures
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 1 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
BTW
2007
Springer
183views Database» more  BTW 2007»
14 years 19 days ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 9 days ago
Improving evolutionary real-time testing
Embedded systems are often used in a safety-critical context, e.g. in airborne or vehicle systems. Typically, timing constraints must be satisfied so that real-time embedded syste...
Marouane Tlili, Stefan Wappler, Harmen Sthamer
VISUALIZATION
1995
IEEE
14 years 5 days ago
An Integrated Approach for Steering, Visualization, and Analysis of Atmospheric Simulations
In the research described here, we have constructed at tightly coupled set of methods for monitoring, steering, and applying visual analysis to large scale simulations. This work ...
Yves Jean, Thomas Kindler, William Ribarsky, Weimi...
CIVR
2008
Springer
271views Image Analysis» more  CIVR 2008»
13 years 10 months ago
Multiple feature fusion by subspace learning
Since the emergence of extensive multimedia data, feature fusion has been more and more important for image and video retrieval, indexing and annotation. Existing feature fusion t...
Yun Fu, Liangliang Cao, Guodong Guo, Thomas S. Hua...