2925 search results - page 579 / 585 » Information Complexity of Online Problems |
VRML
2000
ACM
13 years 11 months ago
2000
ACM
When distributing 3D contents real-time over a network with a narrow bandwidth such as a telephone line, methods for streaming and data compression can be considered indispensable...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
ICCAD
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
PKDD
1999
Springer
13 years 11 months ago
1999
Springer
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
IGIS
1994
13 years 11 months ago
1994
There have been many interpolation methods developed over the years, each with their own problems. One of the biggest limitations in many applications is the non-correspondence of...