Sciweavers

2771 search results - page 118 / 555
» A General Computational Treatment of the Comparative
Sort
View
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
16 years 6 months ago
New notions of security: achieving universal composability without trusted setup
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
Manoj Prabhakaran, Amit Sahai
ACCV
2009
Springer
16 years 29 days ago
Levels of Details for Gaussian Mixture Models
Mixtures of Gaussians are a crucial statistical modeling tool at the heart of many challenging applications in computer vision and machine learning. In this paper, we first descri...
Vincent Garcia, Frank Nielsen, Richard Nock
IPPS
2007
IEEE
16 years 19 days ago
Challenges in Executing Data Intensive Biometric Workloads on a Desktop Grid
Desktop grids have traditionally focused on executing computation intensive workloads. Can they also be used to execute data-intensive workloads? To answer this question, we prese...
Christopher Moretti, Timothy C. Faltemier, Douglas...
ICICIC
2006
IEEE
16 years 12 days ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei
ITICSE
2006
ACM
16 years 9 days ago
A web-based service for the automatic detection of roles of variables
Learning elementary programming can be enhanced by introducing the notion of variable roles to students. This paper presents a web-based automatic role detection service that can ...
Petri Gerdt, Jorma Sajaniemi