Sciweavers

815 search results - page 159 / 163
» Algebraic Recognizability of Languages
Sort
View
ICFEM
2010
Springer
13 years 9 months ago
A Semantic Model for Service Composition with Coordination Time Delays
The correct behavior of a service composition depends on the appropriate coordination of its services. According to the idea of channelbased coordination, services exchange message...
Natallia Kokash, Behnaz Changizi, Farhad Arbab
ICDE
2011
IEEE
258views Database» more  ICDE 2011»
13 years 2 months ago
SystemML: Declarative machine learning on MapReduce
Abstract—MapReduce is emerging as a generic parallel programming paradigm for large clusters of machines. This trend combined with the growing need to run machine learning (ML) a...
Amol Ghoting, Rajasekar Krishnamurthy, Edwin P. D....
ICDT
2009
ACM
130views Database» more  ICDT 2009»
14 years 11 months ago
Towards a theory of search queries
The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as "dataspace models." Such information management sy...
George H. L. Fletcher, Jan Van den Bussche, Dirk V...
PPOPP
2009
ACM
14 years 11 months ago
Compiler-assisted dynamic scheduling for effective parallelization of loop nests on multicore processors
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
Muthu Manikandan Baskaran, Nagavijayalakshmi Vydya...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 11 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine