Sciweavers

17541 search results - page 3117 / 3509
» Complexity in scalable computing
Sort
View
ICML
2010
IEEE
15 years 8 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
LDTA
2010
15 years 7 months ago
Embedding a web-based workflow management system in a functional language
Workflow management systems guide and monitor tasks performed by humans and computers. The workflow specifications are usually expressed in special purpose (graphical) formalisms....
Jan Martin Jansen, Rinus Plasmeijer, Pieter W. M. ...
SIGCOMM
2010
ACM
15 years 7 months ago
Multi-hop packet tracking for experimental facilities
The Internet has become a complex system with increasing numbers of end-systems, applications, protocols and types of networks. Although we have a good understanding of how data i...
Tacio Santos, Christian Henke, Carsten Schmoll, Ta...
SIGCOMM
2010
ACM
15 years 7 months ago
Achieving O(1) IP lookup on GPU-based software routers
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
Jin Zhao, Xinya Zhang, Xin Wang, Xiangyang Xue
SIGMETRICS
2010
ACM
181views Hardware» more  SIGMETRICS 2010»
15 years 7 months ago
A unified modeling framework for distributed resource allocation of general fork and join processing networks
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
« Prev « First page 3117 / 3509 Last » Next »