Sciweavers

5022 search results - page 380 / 1005
» Data structures and problem solving using Java
Sort
View
SPIRE
2005
Springer
15 years 9 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
ICMCS
2006
IEEE
167views Multimedia» more  ICMCS 2006»
15 years 9 months ago
Efficient Object Tracking using Control-Based Observer Design
Kernel-based tracking approaches have proven to be more efficient in computation compared to other tracking approaches such as particle filtering. However, existing kernel-based...
Wei Qu, Dan Schonfeld
DEXA
2004
Springer
129views Database» more  DEXA 2004»
15 years 9 months ago
Using Case Based Retrieval Techniques for Handling Anomalous Situations in Advisory Dialogues
The efficacy of expert systems often depends on the accuracy and completeness of the problem specification negotiated with the user. Therefore, efficient user interfaces are needed...
Marcello L'Abbate, Ingo Frommholz, Ulrich Thiel, E...
CORR
2007
Springer
72views Education» more  CORR 2007»
15 years 3 months ago
A Heuristic Routing Mechanism Using a New Addressing Scheme
Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network ch...
Mohsen Ravanbakhsh, Yasin Abbasi-Yadkori, Maghsoud...
IJON
2000
105views more  IJON 2000»
15 years 3 months ago
G-Prop: Global optimization of multilayer perceptrons using GAs
A general problem in model selection is to obtain the right parameters that make a model "t observed data. For a multilayer perceptron (MLP) trained with back-propagation (BP...
Pedro A. Castillo Valdivieso, Juan J. Merelo Guerv...