Sciweavers

3161 search results - page 227 / 633
» A Discourse on Complexity of Process Models
Sort
View
JMLR
2010
128views more  JMLR 2010»
15 years 2 months ago
Iterative Scaling and Coordinate Descent Methods for Maximum Entropy Models
Maximum entropy (Maxent) is useful in natural language processing and many other areas. Iterative scaling (IS) methods are one of the most popular approaches to solve Maxent. With...
Fang-Lan Huang, Cho-Jui Hsieh, Kai-Wei Chang, Chih...
133
Voted
EUROPAR
2011
Springer
14 years 3 months ago
Model-Driven Tile Size Selection for DOACROSS Loops on GPUs
DOALL loops are tiled to exploit DOALL parallelism and data locality on GPUs. In contrast, due to loop-carried dependences, DOACROSS loops must be skewed first in order to make ti...
Peng Di, Jingling Xue
FCCM
2008
IEEE
212views VLSI» more  FCCM 2008»
15 years 10 months ago
Map-reduce as a Programming Model for Custom Computing Machines
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...
Jackson H. C. Yeung, C. C. Tsang, Kuen Hung Tsoi, ...
150
Voted
INFSOF
2000
91views more  INFSOF 2000»
15 years 3 months ago
An operational approach to the design of workflow systems
We construct models as an aid to our thought process. A particular class of models, operational models, can be used for simulation and prototyping. The Opj modeling language is su...
Rakesh Agarwal, Giorgio Bruno, Marco Torchiano
ICALP
2009
Springer
16 years 4 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...