Sciweavers

194 search results - page 25 / 39
» The Polytope of Degree Partitions
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 11 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
16 years 1 months ago
Parallel Algorithms for Computing Temporal Aggregates
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has outpaced advan...
Jose Alvin G. Gendrano, Bruce C. Huang, Jim M. Rod...
ICML
2002
IEEE
16 years 19 days ago
Action Refinement in Reinforcement Learning by Probability Smoothing
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...
Carles Sierra, Dídac Busquets, Ramon L&oacu...
SIGMOD
2005
ACM
141views Database» more  SIGMOD 2005»
15 years 12 months ago
Fault-tolerance in the Borealis distributed stream processing system
We present a replication-based approach to fault-tolerant distributed stream processing in the face of node failures, network failures, and network partitions. Our approach aims t...
Magdalena Balazinska, Hari Balakrishnan, Samuel Ma...
WCRE
2008
IEEE
15 years 6 months ago
PREREQIR: Recovering Pre-Requirements via Cluster Analysis
High-level software artifacts, such as requirements, domain-specific requirements, and so on, are an important source of information that is often neglected during the reverse- an...
Jane Huffman Hayes, Giuliano Antoniol, Yann-Ga&eum...