Sciweavers

270 search results - page 48 / 54
» Exploiting Problem Structure for Solution Counting
Sort
View
IPPS
2002
IEEE
14 years 18 days ago
Detecting Temporal Logic Predicates on the Happened-Before Model
Detection of a global predicate is a fundamental problem in distributed computing. In this paper we describe new predicate detection algorithms for certain temporal logic predicat...
Alper Sen, Vijay K. Garg
SEMWEB
2010
Springer
13 years 5 months ago
Summary Models for Routing Keywords to Linked Data Sources
The proliferation of linked data on the Web paves the way to a new generation of applications that exploit heterogeneous data from different sources. However, because this Web of d...
Thanh Tran, Lei Zhang, Rudi Studer
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 8 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
CCS
2009
ACM
14 years 2 months ago
Large-scale malware indexing using function-call graphs
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
Xin Hu, Tzi-cker Chiueh, Kang G. Shin