Sciweavers

1397 search results - page 246 / 280
» On the Need for Practical Formal Methods
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
ER
2004
Springer
169views Database» more  ER 2004»
14 years 1 months ago
Intentional Modeling to Support Identity Management
Identity management has arisen as a major and urgent challenge for internet-based communications and information services. Internet services involve complex networks of relationshi...
Lin Liu, Eric S. K. Yu
ESORICS
2004
Springer
14 years 1 months ago
Signature Bouquets: Immutability for Aggregated/Condensed Signatures
Database outsourcing is a popular industry trend which involves organizations delegating their data management needs to an external service provider. In this model, a service prov...
Einar Mykletun, Maithili Narasimha, Gene Tsudik
ICPP
2000
IEEE
14 years 2 days ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
COMPGEOM
2006
ACM
13 years 11 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi