Sciweavers

2485 search results - page 369 / 497
» Time Bounded Frequency Computations
Sort
View
ICS
2010
Tsinghua U.
14 years 5 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
RTSS
1992
IEEE
14 years 1 days ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
SIGMETRICS
2008
ACM
13 years 8 months ago
Scheduling despite inexact job-size information
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring sm...
Adam Wierman, Misja Nuyens
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
14 years 5 days ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
VIS
2008
IEEE
192views Visualization» more  VIS 2008»
14 years 9 months ago
Smooth Surface Extraction from Unstructured Point-based Volume Data Using PDEs
Abstract--Smooth surface extraction using partial differential equations (PDEs) is a well-known and widely used technique for visualizing volume data. Existing approaches operate o...
Paul Rosenthal, Lars Linsen