Sciweavers

13026 search results - page 313 / 2606
» Probabilistic Relational Models
Sort
View
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
16 years 4 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
ICCV
2003
IEEE
16 years 6 months ago
Bayesian Clustering of Optical Flow Fields
We present a method for unsupervised learning of classes of motions in video. We project optical flow fields to a complete, orthogonal, a-priori set of basis functions in a probab...
Jesse Hoey, James J. Little
AMAST
2000
Springer
15 years 8 months ago
Time and Probability in Process Algebra
In the paper we present an ACP-like process algebra which can be used to model both probabilistic and time behaviour of parallel systems. This process algebra is obtained by extens...
Suzana Andova
JUCS
2010
213views more  JUCS 2010»
15 years 2 months ago
Mining Feature-Opinion in Online Customer Reviews for Opinion Summarization
: Online customer reviews is considered as a significant informative resource which is useful for both potential customers and product manufacturers. In web pages, the reviews are ...
Gamgarn Somprasertsri, Pattarachai Lalitrojwong
VALUETOOLS
2006
ACM
128views Hardware» more  VALUETOOLS 2006»
15 years 10 months ago
Relative stability analysis of multiple queues
In this paper we consider a general class of single-server multiqueue systems in which the stability of any single queue can be essentially determined by the queue’s arrival rat...
Sum Lam, Rocky K. C. Chang, Yi Xie