1998 search results - page 391 / 400 » Complexity of the Cover Polynomial |
EUROCRYPT
2000
Springer
14 years 1 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
FLAIRS
2008
14 years 4 days ago
2008
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
COMPGEOM
2005
ACM
13 years 11 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
COMPGEOM
2008
ACM
13 years 11 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
NIPS
2008
13 years 11 months ago
2008
Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchical ...