Sciweavers

4112 search results - page 33 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
108
Voted
RP
2010
Springer
118views Control Systems» more  RP 2010»
15 years 1 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa
115
Voted
TACAS
2010
Springer
156views Algorithms» more  TACAS 2010»
15 years 1 months ago
Preemption Sealing for Efficient Concurrency Testing
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
Thomas Ball, Sebastian Burckhardt, Katherine E. Co...
149
Voted
TIP
2010
165views more  TIP 2010»
14 years 10 months ago
Physically Consistent and Efficient Variational Denoising of Image Fluid Flow Estimates
Imaging plays an important role in experimental fluid dynamics. It is equally important both for scientific research and a range of industrial applications. It is known, however, t...
Andrey Vlasenko, Christoph Schnörr
160
Voted
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 5 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 3 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