Sciweavers

2498 search results - page 359 / 500
» Data Structures with Unpredictable Timing
Sort
View
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 5 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
164
Voted
CINQ
2004
Springer
189views Database» more  CINQ 2004»
15 years 10 months ago
Employing Inductive Databases in Concrete Applications
In this paper we present the application of the inductive database approach to two practical analytical case studies: Web usage mining in Web logs and financial data. As far as co...
Rosa Meo, Pier Luca Lanzi, Maristella Matera, Dani...
152
Voted
CIDR
2003
164views Algorithms» more  CIDR 2003»
15 years 6 months ago
Capacity Bound-free Web Warehouse
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
Yahiko Kambayashi, Kai Cheng
INFOCOM
2011
IEEE
14 years 8 months ago
Continuous multi-dimensional top-k query processing in sensor networks
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang,...
ASPLOS
2006
ACM
15 years 11 months ago
Software-based instruction caching for embedded processors
While hardware instruction caches are present in virtually all general-purpose and high-performance microprocessors today, many embedded processors use SRAM or scratchpad memories...
Jason E. Miller, Anant Agarwal