Sciweavers

431 search results - page 9 / 87
» Implementing the maximum of monotone algorithms
Sort
View
IS
2002
14 years 9 months ago
Pushing extrema aggregates to optimize logic queries
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contr...
Filippo Furfaro, Sergio Greco, Sumit Ganguly, Carl...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
14 years 11 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
RTAS
2010
IEEE
14 years 8 months ago
Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
Karthik Lakshmanan, Ragunathan Rajkumar
JUCS
2007
102views more  JUCS 2007»
14 years 9 months ago
The Use of Runtime Reconfiguration on FPGA Circuits to Increase the Performance of the AES Algorithm Implementation
: This article presents an architecture that encrypts data with the AES algorithm. This architecture can be implemented on the Xilinx Virtex II FPGA family, by applying pipelining ...
Oscar Pérez, Yves Berviller, Camel Tanougas...
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
15 years 4 months ago
Maximum Flow in Directed Planar Graphs with Vertex Capacities
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
Haim Kaplan, Yahav Nussbaum