2314 search results - page 421 / 463 » Minimal Partitions of a Graph |
110
click to vote
INFOVIS
2005
IEEE
15 years 6 months ago
2005
IEEE
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded,...
100
Voted
ITCC
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-a...
128
Voted
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
127
Voted
ASP
2005
Springer
15 years 6 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
118
Voted
DAGM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...