Sciweavers

32545 search results - page 546 / 6509
» Data Structures and Algorithms
Sort
View
ISAAC
2005
Springer
90views Algorithms» more  ISAAC 2005»
16 years 21 days ago
Approximate Colored Range Queries
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
Ying Kit Lai, Chung Keung Poon, Benyun Shi
CIKM
2006
Springer
15 years 11 months ago
Amnesic online synopses for moving objects
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
ACL
1994
15 years 8 months ago
Precise N-Gram Probabilities from Stochastic Context-Free Grammars
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
Andreas Stolcke, Jonathan Segal
ICDM
2008
IEEE
108views Data Mining» more  ICDM 2008»
16 years 1 months ago
Non-negative Matrix Factorization on Manifold
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
Deng Cai, Xiaofei He, Xiaoyun Wu, Jiawei Han
KES
2006
Springer
15 years 7 months ago
Construction of Symbolic Representation from Human Motion Information
Abstract In general, avatar-based communication has a merit that it can represent non-verbal information. The simplest way of representing the non-verbal information is to capture ...
Yutaka Araki, Daisaku Arita, Rin-ichiro Taniguchi,...