Sciweavers

1096 search results - page 76 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
EUROCRYPT
2006
Springer
15 years 10 months ago
Symplectic Lattice Reduction and NTRU
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
Nicolas Gama, Nick Howgrave-Graham, Phong Q. Nguye...
ICPR
2008
IEEE
16 years 23 days ago
On-line boosted cascade for object detection
On-line boosting is a recent advancement in the field of machine learning that has opened a new spectrum of possibilities in many diverse fields. With respect to a static strong...
Ingrid Visentini, Lauro Snidaro, Gian Luca Foresti
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
15 years 10 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
EAAI
2007
154views more  EAAI 2007»
15 years 6 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de...
Ahlem Ben Hassine, Tu Bao Ho
BMVC
2010
15 years 4 months ago
Background Modelling on Tensor Field for Foreground Segmentation
The paper proposes a new method to perform foreground detection by means of background modeling using the tensor concept. Sometimes, statistical modelling directly on image values...
Rui Caseiro, Jorge Batista, Pedro Martins