2163 search results - page 205 / 433 » cases 2004 |
154
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
144
click to vote
TACAS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
180
click to vote
TYPES
2004
Springer
15 years 12 months ago
2004
Springer
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...
161
click to vote
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
Given two geographic databases, a fusion algorithm should produce all pairs of corresponding objects (i.e., objects that represent the same real-world entity). Four fusion algorit...
172
click to vote
WG
2004
Springer
15 years 12 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...