Sciweavers

1521 search results - page 128 / 305
» The Stardinates - Visualizing Highly Structured Data
Sort
View
CVPR
2007
IEEE
16 years 5 months ago
Robust Change-Detection by Normalised Gradient-Correlation
A novel algorithm for robustly segmenting changes between different images of a scene is presented. This computationally efficient algorithm is based on a non-linear comparison of...
Robert O'Callaghan, Tetsuji Haga
ICDIM
2008
IEEE
15 years 10 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
166
Voted
ICALP
1994
Springer
15 years 7 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias
133
Voted
CAISE
1995
Springer
15 years 7 months ago
Process Improvement - The Way Forward
, methods, techniques and tools. High level languages, structured programming, abstract data types, formal methods, non-procedural programming, object orientation, CASE, support en...
M. M. Lehman
110
Voted
HT
1991
ACM
15 years 7 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold