Sciweavers

7006 search results - page 1233 / 1402
» Approximation Algorithms
Sort
View
145
Voted
COCOON
2007
Springer
15 years 11 months ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
15 years 11 months ago
Non-breaking Similarity of Genomes with Gene Repetitions
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...
DEXA
2007
Springer
154views Database» more  DEXA 2007»
15 years 11 months ago
Performance Oriented Schema Matching
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...
Khalid Saleem, Zohra Bellahsene, Ela Hunt
CVPR
2009
IEEE
15 years 11 months ago
Catadioptric Projectors
We present a catadioptric projector analogous to a catadioptric camera by combining a commodity digital projector with additional optical units. We show that, by using specially sh...
Yuanyuan Ding, Jing Xiao, Kar-Han Tan, Jingyi Yu
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
15 years 11 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
« Prev « First page 1233 / 1402 Last » Next »