Sciweavers

361 search results - page 33 / 73
» Finding Optimal Pairs of Patterns
Sort
View
CHI
2002
ACM
14 years 8 months ago
Characterizing instant messaging from recorded logs
Most studies about instant messaging (IM) are based on self-report data. We logged thousands of real IM conversations and examined them to find characteristic patterns of IM use i...
Ellen Isaacs, Candace A. Kamm, Diane J. Schiano, A...
COGSCI
2002
99views more  COGSCI 2002»
13 years 8 months ago
Learning words from sights and sounds: a computational model
This paper presents an implemented computational model of word acquisition which learns directly from raw multimodal sensory input. Set in an information theoretic framework, the ...
Deb Roy, Alex Pentland
MM
2006
ACM
180views Multimedia» more  MM 2006»
14 years 2 months ago
Fast tracking of near-duplicate keyframes in broadcast domain with transitivity propagation
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
Chong-Wah Ngo, Wanlei Zhao, Yu-Gang Jiang
CVPR
2009
IEEE
15 years 3 months ago
Discriminative Subvolume Search for Efficient Action Detection
Actions are spatio-temporal patterns which can be characterized by collections of spatio-temporal invariant features. Detection of actions is to find the re-occurrences (e.g. th...
Junsong Yuan (Northwestern University), Zicheng Li...
CSR
2006
Springer
14 years 4 days ago
Window Subsequence Problems for Compressed Texts
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
Patrick Cégielski, Irène Guessarian,...