Sciweavers

12055 search results - page 2302 / 2411
» High Performance Banking
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
15 years 7 months ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
SAS
2000
Springer
149views Formal Methods» more  SAS 2000»
15 years 7 months ago
FULLDOC: A Full Reporting Debugger for Optimized Code
As compilers increasingly rely on optimizations to achieve high performance, the effectiveness of source level debuggers for optimized code continues to falter. Even if values of s...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa
ICCV
1995
IEEE
15 years 7 months ago
Fast Object Recognition in Noisy Images Using Simulated Annealing
A fast simulatedannealingalgorithmis developed for automatic object recognition. The object recognition problem is addressed as the problem of best describing a match between a hy...
Margrit Betke, Nicholas C. Makris
ICDCS
1995
IEEE
15 years 7 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere
ISER
1995
Springer
131views Robotics» more  ISER 1995»
15 years 7 months ago
Stiffness Isn't Everything
Most robot designers make the mechanical interface between an actuator and its load as stiff as possible[9][10]. This makes sense in traditional position-controlled systems, becau...
Gill A. Pratt, Matthew M. Williamson, Peter Dilwor...
« Prev « First page 2302 / 2411 Last » Next »