Sciweavers

906 search results - page 148 / 182
» Map graphs
Sort
View
SIGSOFT
2006
ACM
14 years 9 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
WWW
2009
ACM
14 years 9 months ago
idMesh: graph-based disambiguation of linked data
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
Hermann de Meer, Karl Aberer, Michael Jost, Parisa...
WWW
2008
ACM
14 years 9 months ago
Topic modeling with network regularization
In this paper, we formally define the problem of topic modeling with network structure (TMN). We propose a novel solution to this problem, which regularizes a statistical topic mo...
Qiaozhu Mei, Deng Cai, Duo Zhang, ChengXiang Zhai
OSDI
2004
ACM
14 years 9 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
ICCAD
2002
IEEE
117views Hardware» more  ICCAD 2002»
14 years 5 months ago
An energy-conscious algorithm for memory port allocation
Multiport memories are extensively used in modern system designs because of the performance advantages they offer. The increased memory access throughput could lead to significan...
Preeti Ranjan Panda, Lakshmikantam Chitturi