Sciweavers

6104 search results - page 884 / 1221
» Constructing Information Bases Using Associative Structures
Sort
View
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
15 years 11 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
CAV
2001
Springer
83views Hardware» more  CAV 2001»
15 years 9 months ago
Iterating Transducers
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
Dennis Dams, Yassine Lakhnech, Martin Steffen
NIPS
1994
15 years 6 months ago
Boosting the Performance of RBF Networks with Dynamic Decay Adjustment
Radial Basis Function (RBF) Networks, also known as networks of locally{tuned processing units (see 6]) are well known for their ease of use. Most algorithms used to train these t...
Michael R. Berthold, Jay Diamond
SEAA
2008
IEEE
15 years 11 months ago
GRAIL - A Tool for Accessing and Instrumenting WSRF - compliant Web Services
Grid access methods are still dominated by command line tools or manually developed, problem specific graphical user interfaces. This fact reduces the acceptance of the Grid for ...
Thomas Jejkal, Rainer Stotzka, Michael Sutter
TOG
2002
116views more  TOG 2002»
15 years 4 months ago
Linear combination of transformations
Geometric transformations are most commonly represented as square matrices in computer graphics. Following simple geometric arguments we derive a natural and geometrically meaning...
Marc Alexa