Sciweavers

1968 search results - page 336 / 394
» The Complexity of Valued Constraint Models
Sort
View
3DIM
2011
IEEE
12 years 8 months ago
Visual Hull from Imprecise Polyhedral Scene
—We present a framework to compute the visual hull of a polyhedral scene, in which the vertices of the polyhedra are given with some imprecision. Two kinds of visual event surfac...
Peng He, Abbas Edalat
AAAI
2011
12 years 8 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
14 years 2 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
BMCBI
2007
133views more  BMCBI 2007»
13 years 8 months ago
An efficient pseudomedian filter for tiling microrrays
Background: Tiling microarrays are becoming an essential technology in the functional genomics toolbox. They have been applied to the tasks of novel transcript identification, elu...
Thomas E. Royce, Nicholas Carriero, Mark B. Gerste...
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
11 years 11 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...