Sciweavers

1275 search results - page 194 / 255
» time 1998
Sort
View
137
Voted
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 7 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
95
Voted
UIST
1998
ACM
15 years 7 months ago
Interactive Visualization of Serial Periodic Data
Serial periodic data exhibit both serial and periodic properties. For example, time continues forward serially, but weeks, months, and years are periods that recur. While there ar...
John V. Carlis, Joseph A. Konstan
83
Voted
UIST
1998
ACM
15 years 7 months ago
A Negotiation Architecture for Fluid Documents
The information presented in a document often consists of primary content as well as supporting material such as explanatory notes, detailed derivations, illustrations, and the li...
Bay-Wei Chang, Jock D. Mackinlay, Polle Zellweger,...
112
Voted
UIST
1998
ACM
15 years 7 months ago
Informative Things: How to Attach Information to the Real World
We describe a new method and implementation for managing information through the use of physical objects. In today’s networked world, the trend is toward working in a global vir...
Rob Barrett, Paul P. Maglio
136
Voted
ECAI
1998
Springer
15 years 7 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein