Sciweavers

242 search results - page 29 / 49
» An Efficient Method for Indexing Now-relative Bitemporal dat...
Sort
View
ICDM
2007
IEEE
162views Data Mining» more  ICDM 2007»
13 years 11 months ago
Exploiting Network Structure for Active Inference in Collective Classification
Active inference seeks to maximize classification performance while minimizing the amount of data that must be labeled ex ante. This task is particularly relevant in the context o...
Matthew J. Rattigan, Marc Maier, David Jensen, Bin...
COMPSEC
2004
91views more  COMPSEC 2004»
13 years 7 months ago
Predicting the intrusion intentions by observing system call sequences
Identifying the intentions or attempts of the monitored agents through observations is very vital in computer network security. In this paper, a plan recognition method for predict...
Li Feng, Xiaohong Guan, Sangang Guo, Yan Gao, Pein...
VLDB
1997
ACM
141views Database» more  VLDB 1997»
13 years 12 months ago
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
Thomas Seidl, Hans-Peter Kriegel
TIP
2008
208views more  TIP 2008»
13 years 7 months ago
Vision Processing for Realtime 3-D Data Acquisition Based on Coded Structured Light
Structured light vision systems have been successfully used for accurate measurement of 3-D surfaces in computer vision. However, their applications are mainly limited to scanning ...
S. Y. Chen, Y. F. Li, Jianwei Zhang
IS
2007
13 years 7 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...