Sciweavers

19866 search results - page 356 / 3974
» Computing all factorizations in ***
Sort
View
EUROCRYPT
2007
Springer
15 years 10 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
CVPR
2007
IEEE
16 years 8 months ago
Joint Optimization of Cascaded Classifiers for Computer Aided Detection
The existing methods for offline training of cascade classifiers take a greedy search to optimize individual classifiers in the cascade, leading inefficient overall performance. W...
Murat Dundar, Jinbo Bi
COMPLEXITY
2006
144views more  COMPLEXITY 2006»
15 years 6 months ago
BML revisited: Statistical physics, computer simulation, and probability
Statistical physics, computer simulation and discrete mathematics are intimately related through the study of shared lattice models. These models lie at the foundation of all thre...
Raissa M. D'Souza
FUIN
2010
89views more  FUIN 2010»
15 years 5 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
ASPLOS
2006
ACM
16 years 23 days ago
Tartan: evaluating spatial computation for whole program execution
Spatial Computing (SC) has been shown to be an energy-efficient model for implementing program kernels. In this paper we explore the feasibility of using SC for more than small k...
Mahim Mishra, Timothy J. Callahan, Tiberiu Chelcea...