Sciweavers

6437 search results - page 1114 / 1288
» Parallel Algorithms for Arrangements
Sort
View
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
15 years 5 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco
CODES
2008
IEEE
15 years 4 months ago
Software optimization for MPSoC: a mpeg-2 decoder case study
Using traditional software profiling to optimize embedded software in an MPSoC design is not reliable. With multiple processors running concurrently and programs interacting, trad...
Eric Cheung, Harry Hsieh, Felice Balarin
AAAI
2010
15 years 4 months ago
Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
Kevin Regan, Craig Boutilier
DICTA
2007
15 years 4 months ago
Efficient Image Processing with the Apply Language
Apply is a Domain-Specific Language for image processing and low-level computer vision. Apply allows programmers to write kernel operations that focus on the computation for a sin...
Leonard G. C. Hamey
NIPS
2008
15 years 4 months ago
Asynchronous Distributed Learning of Topic Models
Distributed learning is a problem of fundamental interest in machine learning and cognitive science. In this paper, we present asynchronous distributed learning algorithms for two...
Arthur Asuncion, Padhraic Smyth, Max Welling
« Prev « First page 1114 / 1288 Last » Next »