Sciweavers

1456 search results - page 143 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 5 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
126
Voted
COR
2010
121views more  COR 2010»
15 years 4 months ago
A multi-objective approach for robust airline scheduling
We present a memetic approach for multi-objective improvement of robustness influencing features (called robustness objectives) in airline schedules. Improvement of the objectives...
Edmund K. Burke, Patrick De Causmaecker, Geert De ...
JCB
2002
160views more  JCB 2002»
15 years 3 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
IVC
2007
131views more  IVC 2007»
15 years 4 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...
IPCO
2007
126views Optimization» more  IPCO 2007»
15 years 5 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...