Sciweavers

29152 search results - page 389 / 5831
» A Model of Computation for MapReduce
Sort
View
COLING
1996
15 years 8 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
CSI
2007
89views more  CSI 2007»
15 years 7 months ago
Writing and executing ODP computational viewpoint specifications using Maude
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
José Raúl Romero, Antonio Vallecillo...
WWW
2004
ACM
16 years 8 months ago
QoS computation and policing in dynamic web service selection
The emerging Service-Oriented Computing (SOC) paradigm promises to enable businesses and organizations to collaborate in an unprecedented way by means of standard web services. To...
Yutu Liu, Anne H. H. Ngu, Liangzhao Zeng
GRC
2007
IEEE
16 years 1 months ago
Perceptual Reasoning: A New Computing with Words Engine
— Zadeh proposed the paradigm of computing with words (CWW). We have proposed a CWW architecture for making subjective judgments, called a Perceptual Computer (PerC). Because wor...
Jerry M. Mendel, Dongrui Wu
CLOUD
2010
ACM
16 years 19 days ago
Comet: batched stream processing for data intensive distributed computing
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
Bingsheng He, Mao Yang, Zhenyu Guo, Rishan Chen, B...