325 search results - page 33 / 65 » ideas 2002 |
84
Voted
CADE
2002
Springer
15 years 10 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
92
Voted
SIGMOD
2002
ACM
15 years 10 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
85
Voted
ICFP
2002
ACM
15 years 10 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
69
Voted
ESORICS
2002
Springer
15 years 9 months ago
2002
Springer
It is believed that masking is an effective countermeasure against power analysis attacks: before a certain operation involving a key is performed in a cryptographic chip, the inpu...
107
click to vote
ALT
2002
Springer
15 years 7 months ago
2002
Springer
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...