Sciweavers

840 search results - page 152 / 168
» The Complexity of the Extended GCD Problem
Sort
View
WOLLIC
2010
Springer
14 years 24 days ago
Modal Logics with Counting
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
Carlos Areces, Guillaume Hoffmann, Alexandre Denis
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 7 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
NOMS
1998
IEEE
133views Communications» more  NOMS 1998»
13 years 12 months ago
ATM customer network management using WWW and CORBA technologies
In this paper, we present a framework for managing ATM customer networks using WWW and CORBA technologies. The WWW technology may provide network management operators with platfor...
Jong-Wook Baek, Tae-Joon Ha, Jong-Tae Park, James ...
SIGMOD
1996
ACM
133views Database» more  SIGMOD 1996»
13 years 12 months ago
Multi-dimensional Resource Scheduling for Parallel Queries
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
Minos N. Garofalakis, Yannis E. Ioannidis
DBVIS
1993
101views Database» more  DBVIS 1993»
13 years 12 months ago
Using Visualization to Support Data Mining of Large Existing Databases
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
Daniel A. Keim, Hans-Peter Kriegel