3471 search results - page 605 / 695 » Obstacle Numbers of Graphs |
134
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
140
Voted
CC
2004
Springer
15 years 10 months ago
2004
Springer
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
130
Voted
DEXA
2004
Springer
15 years 10 months ago
2004
Springer
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
135
Voted
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Automated negotiation techniques have received considerable attention over the past decade, and much progress has been made in developing negotiation protocols and strate...
140
Voted
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...