Sciweavers

1170 search results - page 55 / 234
» How Fast Is Too Fast
Sort
View
105
Voted
VLDB
2001
ACM
92views Database» more  VLDB 2001»
15 years 7 months ago
Fast Evaluation Techniques for Complex Similarity Queries
Complex similarity queries, i.e., multi-feature multi-object queries, are needed to express the information need of a user against a large multimedia repository. Even if a user in...
Klemens Böhm, Michael Mlivoncic, Hans-Jö...
123
Voted
ACMDIS
2000
ACM
15 years 7 months ago
Just-in-Time Design in a Fast-Paced Product Group
In real world development environments where deadlines are fixed, a designer must craft a process that works with the team and within the constraints of a project. The traditional...
Margo Lustig Ezekiel
103
Voted
AES
2000
Springer
82views Cryptology» more  AES 2000»
15 years 7 months ago
Fast Implementations of AES Candidates
Of the five AES finalists four—MARS, RC6, Rijndael, Twofish— have not only (expected) good security but also exceptional performance on the PC platforms, especially on those...
Kazumaro Aoki, Helger Lipmaa
179
Voted
CIKM
2005
Springer
15 years 4 months ago
Fast on-line index construction by geometric partitioning
Inverted index structures are the mainstay of modern text retrieval systems. They can be constructed quickly using off-line mergebased methods, and provide efficient support for ...
Nicholas Lester, Alistair Moffat, Justin Zobel
105
Voted
IJCAI
2007
15 years 4 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert