1952 search results - page 83 / 391 » Complete partitions of graphs |
132
click to vote
VTC
2007
IEEE
15 years 10 months ago
2007
IEEE
— The intentionally imposed or inherent unintentional residual redundancy found in source encoded bitstreams can be exploited for supporting joint SoftBit-Source Decoding and Cha...
147
click to vote
DL
1999
Springer
15 years 8 months ago
1999
Springer
As part of the Illinois Digital Library Initiative (DLI) project we developed “scalable semantics” technologies. These statistical techniques enabled us to index large collect...
152
click to vote
IJCAI
2003
15 years 5 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
122
click to vote
JANCL
2002
15 years 3 months ago
2002
We prove frame determination results for the family of many-valued modal logics introduced by M. Fitting in the early '90s. Each modal language of this family is based on a H...
144
click to vote
CPC
2007
15 years 4 months ago
2007
Abstract. Szemer´edi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques de...