Sciweavers

1133 search results - page 112 / 227
» Basics of Graph Cuts
Sort
View
COR
2010
146views more  COR 2010»
14 years 10 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
ICALP
1992
Springer
15 years 2 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
KDD
2004
ACM
109views Data Mining» more  KDD 2004»
15 years 10 months ago
Identifying early buyers from purchase data
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
Paat Rusmevichientong, Shenghuo Zhu, David Selinge...
ATMOS
2009
130views Optimization» more  ATMOS 2009»
14 years 11 months ago
Arc-Flags in Dynamic Graphs
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel ...
JAPLL
2010
85views more  JAPLL 2010»
14 years 4 months ago
Hybrid logic with the difference modality for generalisations of graphs
We discuss recent work generalising the basic hybrid logic with the difference modality to any reasonable notion of transition. This applies equally to both subrelational transiti...
Robert S. R. Myers, Dirk Pattinson