Sciweavers

820 search results - page 110 / 164
» Finding low-utility data structures
Sort
View
CARS
2001
13 years 10 months ago
Rendering and interaction in co-operative 3-D image analysis
Most interactive segmentation methods are defined at a 2-d level requiring sometimes extensive interaction when the object of interest is difficult to be outlined by simple means ...
Klaus D. Tönnies, Manfred Hinz, Regina Pohle
DSS
2006
170views more  DSS 2006»
13 years 9 months ago
Adoption of internet banking: An empirical study in Hong Kong
This study investigates how customers perceive and adopt Internet Banking (IB) in Hong Kong. We developed a theoretical model based on the Technology Acceptance Model (TAM) with a...
T. C. Edwin Cheng, David Y. C. Lam, Andy C. L. Yeu...
TIP
2008
131views more  TIP 2008»
13 years 8 months ago
Hyperspectral Image Compression: Adapting SPIHT and EZW to Anisotropic 3-D Wavelet Coding
Abstract--Hyperspectral images present some specific characteristics that should be used by an efficient compression system. In compression, wavelets have shown a good adaptability...
Emmanuel Christophe, Corinne Mailhes, Pierre Duham...
ICEIS
2009
IEEE
13 years 6 months ago
Mining Patterns in the Presence of Domain Knowledge
One of the main difficulties of pattern mining is to deal with items of different nature in the same itemset, which can occur in any domain except basket analysis. Indeed, if we co...
Cláudia Antunes
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 9 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...