Sciweavers

61 search results - page 11 / 13
» Hit Miss Networks with Applications to Instance Selection
Sort
View
88
Voted
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
14 years 10 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
COORDINATION
2006
Springer
15 years 3 months ago
A WSDL-Based Type System for WS-BPEL
We tackle the problem of providing rigorous formal foundations to current software engineering technologies for web services. We focus on two of the most used XML-based languages f...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 22 hour 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...
MIDDLEWARE
2007
Springer
15 years 5 months ago
Using checkpointing to recover from poor multi-site parallel job scheduling decisions
Recent research in multi-site parallel job scheduling leverages user-provided estimates of job communication characteristics to effectively partition the job across multiple clus...
William M. Jones
SIGSOFT
2008
ACM
16 years 11 days ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su