524 search results - page 100 / 105 » On the Maximum Number of Cliques in a Graph |
172
Voted
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
170
click to vote
STACS
2007
Springer
16 years 24 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
167
Voted
RTCSA
2006
IEEE
16 years 20 days ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
166
Voted
ASIAN
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. A software birthmark is a unique characteristic of a program that can be used as a software theft detection. In this paper we suggest and empirically evaluate a static bi...
161
Voted
MOBICOM
2006
ACM
16 years 19 days ago
2006
ACM
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distrib...