Sciweavers

488 search results - page 76 / 98
» Unbounded Transactional Memory
Sort
View
DAWAK
2006
Springer
14 years 14 days ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin
DC
2008
13 years 8 months ago
Solo-valency and the cost of coordination
This paper introduces solo-valency, a variation on the valency proof technique originated by Fischer, Lynch, and Paterson. The new technique focuses on critical events that influe...
Danny Hendler, Nir Shavit
JMLR
2010
156views more  JMLR 2010»
13 years 3 months ago
Collaborative Filtering on a Budget
Matrix factorization is a successful technique for building collaborative filtering systems. While it works well on a large range of problems, it is also known for requiring signi...
Alexandros Karatzoglou, Alexander J. Smola, Markus...
ATVA
2011
Springer
254views Hardware» more  ATVA 2011»
12 years 8 months ago
Formal Analysis of Online Algorithms
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
Benjamin Aminof, Orna Kupferman, Robby Lampert
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
12 years 8 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams