Sciweavers

16430 search results - page 902 / 3286
» On Computable Tree Functions
Sort
View
ICMCS
2009
IEEE
250views Multimedia» more  ICMCS 2009»
15 years 5 months ago
Efficient sparse self-similarity matrix construction for repeating sequence detection
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...
Lei Wang, Chng Eng Siong, Haizhou Li
ICDAR
2011
IEEE
14 years 7 months ago
Math Spotting: Retrieving Math in Technical Documents Using Handwritten Query Images
—A method for locating mathematical expressions in document images without the use of optical character recognition is presented. An index of document regions is produced from re...
Richard Zanibbi, Li Yu
AAAI
2012
13 years 10 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
ICML
2006
IEEE
16 years 8 months ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
WWW
2002
ACM
16 years 8 months ago
Multimedia meets computer graphics in SMIL2.0: a time model for the web
Multimedia scheduling models provide a rich variety of tools for managing the synchronization of media like video and audio, but generally have an inflexible model for time itself...
Patrick Schmitz