778 search results - page 147 / 156 » Bounding Smooth Integers |
115
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
124
click to vote
GFKL
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
125
click to vote
ASM
2004
ASM
15 years 9 months ago
2004
ASM
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
144
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
147
Voted
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...