Sciweavers

2924 search results - page 336 / 585
» Lower Bounds in Distributed Computing
Sort
View
FSE
2004
Springer
113views Cryptology» more  FSE 2004»
15 years 10 months ago
Minimum Distance between Bent and 1-Resilient Boolean Functions
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
Soumen Maity, Subhamoy Maitra
GD
2004
Springer
15 years 10 months ago
Layout Volumes of the Hypercube
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Gr...
Lubomir Torok, Imrich Vrto
DEXA
2003
Springer
135views Database» more  DEXA 2003»
15 years 9 months ago
On the Optimality of Holistic Algorithms for Twig Queries
Streaming XML documents has many emerging applications. However, in this paper, we show that the restrictions imposed by data streaming are too restrictive for processing twig quer...
Byron Choi, Malika Mahoui, Derick Wood
137
Voted
FGR
2004
IEEE
161views Biometrics» more  FGR 2004»
15 years 8 months ago
AdaBoost with Totally Corrective Updates for Fast Face Detection
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
Jan Sochman, Jiri Matas
CPAIOR
2006
Springer
15 years 8 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu