Sciweavers

1517 search results - page 301 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
TACS
1994
Springer
13 years 11 months ago
A Semantic Theory for Concurrent ML
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
Dominique Bolignano, Mourad Debbabi
CAD
2006
Springer
13 years 7 months ago
On visual similarity based 2D drawing retrieval
A large amount of 2D drawings have been produced in engineering fields. To reuse and share the available drawings efficiently, we propose two methods in this paper, namely 2.5D sp...
Jiantao Pu, Karthik Ramani
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
WWW
2008
ACM
14 years 8 months ago
A comparative analysis of web and peer-to-peer traffic
Peer-to-Peer (P2P) applications continue to grow in popularity, and have reportedly overtaken Web applications as the single largest contributor to Internet traffic. Using traces ...
Naimul Basher, Aniket Mahanti, Anirban Mahanti, Ca...
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 7 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid