Sciweavers

150 search results - page 27 / 30
» Fast Unimodular Counting
Sort
View
SIGCOMM
2006
ACM
14 years 1 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
ASAP
2005
IEEE
121views Hardware» more  ASAP 2005»
14 years 1 months ago
Using TLM for Exploring Bus-based SoC Communication Architectures
As billion transistor System-on-chips (SoC) become commonplace and design complexity continues to increase, designers are faced with the daunting task of meeting escalating design...
Sudeep Pasricha, Mohamed Ben-Romdhane
SBP
2010
Springer
14 years 20 days ago
Social Network Data and Practices: The Case of Friendfeed
Due to their large worldwide adoption, Social Network Sites (SNSs) have been widely used in many global events as an important source to spread news and information. While the sear...
Fabio Celli, F. Marta L. Di Lascio, Matteo Magnani...
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
14 years 15 days ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
ASPLOS
2000
ACM
13 years 12 months ago
Thread Level Parallelism and Interactive Performance of Desktop Applications
Multiprocessing is already prevalent in servers where multiple clients present an obvious source of thread-level parallelism. However, the case for multiprocessing is less clear f...
Krisztián Flautner, Richard Uhlig, Steven K...