Sciweavers

564 search results - page 32 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
SOFSEM
2007
Springer
14 years 1 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
RTAS
2010
IEEE
13 years 5 months ago
An Efficient Algorithm for Real-Time Divisible Load Scheduling
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is be...
Anwar Mamat, Ying Lu, Jitender S. Deogun, Steve Go...
ICML
2009
IEEE
14 years 2 months ago
Learning linear dynamical systems without sequence information
Virtually all methods of learning dynamic systems from data start from the same basic assumption: that the learning algorithm will be provided with a sequence, or trajectory, of d...
Tzu-Kuo Huang, Jeff Schneider
DM
2006
91views more  DM 2006»
13 years 7 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
SIAMSC
2008
179views more  SIAMSC 2008»
13 years 7 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros