Sciweavers

23557 search results - page 4312 / 4712
» Distributed Computing - Introduction
Sort
View
CORR
2012
Springer
176views Education» more  CORR 2012»
13 years 11 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
CSCW
2012
ACM
13 years 11 months ago
Social coding in GitHub: transparency and collaboration in an open software repository
Social applications on the web let users track and follow the activities of a large number of others regardless of location or affiliation. There is a potential for this transpare...
Laura A. Dabbish, H. Colleen Stuart, Jason Tsay, J...
ESOP
2012
Springer
13 years 11 months ago
Multiparty Session Types Meet Communicating Automata
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
Pierre-Malo Deniélou, Nobuko Yoshida
MICRO
2010
IEEE
153views Hardware» more  MICRO 2010»
15 years 1 months ago
Scalable Speculative Parallelization on Commodity Clusters
While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In...
Hanjun Kim, Arun Raman, Feng Liu, Jae W. Lee, Davi...
JMLR
2012
13 years 6 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
« Prev « First page 4312 / 4712 Last » Next »