Sciweavers

656 search results - page 48 / 132
» Minimal non-convex words
Sort
View
TASLP
2002
82views more  TASLP 2002»
14 years 9 months ago
Graceful degradation of speech recognition performance over packet-erasure networks
Abstract--This paper explores packet loss recovery for automatic speech recognition (ASR) in spoken dialog systems, assuming an architecture in which a lightweight client communica...
Constantinos Boulis, Mari Ostendorf, Eve A. Riskin...
ACCV
2010
Springer
14 years 5 months ago
Optimizing Visual Vocabularies Using Soft Assignment Entropies
The state of the art for large database object retrieval in images is based on quantizing descriptors of interest points into visual words. High similarity between matching image r...
Yubin Kuang, Kalle Åström, Lars Kopp, M...
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
14 years 9 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
FOCS
2007
IEEE
15 years 4 months ago
Non-Linear Index Coding Outperforming the Linear Optimum
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
Eyal Lubetzky, Uri Stav
IPL
2007
105views more  IPL 2007»
14 years 9 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk