Sciweavers

25316 search results - page 4826 / 5064
» Computational sensor networks
Sort
View
CIKM
2009
Springer
15 years 8 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
DIM
2007
ACM
15 years 8 months ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
VLSID
2010
IEEE
173views VLSI» more  VLSID 2010»
15 years 8 months ago
Voltage-Frequency Planning for Thermal-Aware, Low-Power Design of Regular 3-D NoCs
Network-on-Chip combined with Globally Asynchronous Locally Synchronous paradigm is a promising architecture for easy IP integration and utilization with multiple voltage levels. ...
Mohammad Arjomand, Hamid Sarbazi-Azad
HT
2007
ACM
15 years 7 months ago
Identifying subcommunities using cohesive subgroups in social hypertext
Web pages can be modeled as nodes in a social network, and hyperlinks between pages form links (relationships) between the nodes. Links may take the form of comments, for example ...
Alvin Chin, Mark H. Chignell
GLVLSI
2009
IEEE
172views VLSI» more  GLVLSI 2009»
15 years 7 months ago
Contact merging algorithm for efficient substrate noise analysis in large scale circuits
A methodology is proposed to efficiently estimate the substrate noise generated by large scale aggressor circuits. Small spatial voltage differences within the ground distribution...
Emre Salman, Renatas Jakushokas, Eby G. Friedman, ...
« Prev « First page 4826 / 5064 Last » Next »