Sciweavers

1661 search results - page 332 / 333
» Space-time Interest Points
Sort
View
CRYPTO
2011
Springer
207views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Secure Computation on the Web: Computing without Simultaneous Interaction
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
Shai Halevi, Yehuda Lindell, Benny Pinkas
DAGSTUHL
2011
13 years 9 months ago
Feature Extraction for DW-MRI Visualization: The State of the Art and Beyond
By measuring the anisotropic self-diffusion rates of water, Diffusion Weighted Magnetic Resonance Imaging (DW-MRI) provides a unique noninvasive probe of fibrous tissue. In par...
Thomas Schultz

Publication
303views
13 years 7 months ago
Evolutionary synthesis of analog networks
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...
Claudio Mattiussi
EUROSYS
2006
ACM
15 years 6 months ago
Experiences in building and operating ePOST, a reliable peer-to-peer application
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
Alan Mislove, Ansley Post, Andreas Haeberlen, Pete...
71
Voted
CORR
2007
Springer
126views Education» more  CORR 2007»
14 years 9 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...