11345 search results - page 1714 / 2269 » Foundations of Computer Science |
152
Voted
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we first explore the group theoretic techniques developed for graph isomorphism. We specifically discuss the techniques developed by Luks for solving constrained v...
167
Voted
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
178
Voted
COLT
2001
Springer
15 years 10 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
146
click to vote
ICSE
2001
IEEE-ACM
15 years 10 months ago
2001
IEEE-ACM
This panel gives a non-standard view of the future of software engineering. Two of the speakers are recent Ph.D. graduates in computer science, with expertise in software engineer...
195
click to vote
ROBVIS
2001
Springer
15 years 10 months ago
2001
Springer
This paper reviews papers on tracking people in a video surveillance system, and it presents a new system designed for being able to cope with shadows in a real-time application f...