Sciweavers

2907 search results - page 349 / 582
» Presentations of Structures in Admissible Sets
Sort
View
201
Voted
COR
2010
146views more  COR 2010»
15 years 6 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
PR
2006
116views more  PR 2006»
15 years 6 months ago
Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
Clustering algorithms are routinely used in biomedical disciplines, and are a basic tool in bioinformatics. Depending on the task at hand, there are two most popular options, the ...
Stefano Rovetta, Francesco Masulli
APIN
2004
97views more  APIN 2004»
15 years 6 months ago
FSfRT: Forecasting System for Red Tides
A hybrid neuro-symbolic problem-solving model is presented in which the aim is to forecast parameters of a complex and dynamic environment in an unsupervised way. In situations in ...
Florentino Fdez-Riverola, Juan M. Corchado
CGF
2011
14 years 10 months ago
Dynamic Insets for Context-Aware Graph Navigation
Maintaining both overview and detail while navigating in graphs, such as road networks, airline route maps, or social networks, is difficult, especially when targets of interest ...
S. Ghani, N. Henry Riche, N. Elmqvist
ICDE
2005
IEEE
122views Database» more  ICDE 2005»
16 years 12 days ago
Autonomous Index Optimization in XML Databases
Abstract— Defining suitable indexes is a major task when optimizing a database. Usually, a human database administrator defines a set of indexes in the design phase of the data...
Beda Christoph Hammerschmidt, Martin Kempa, Volker...