11348 search results - page 2102 / 2270 » On time-scale designs for networks |
204
click to vote
PAKDD
2011
ACM
14 years 9 months ago
2011
ACM
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
184
click to vote
CCECE
2011
IEEE
14 years 6 months ago
2011
IEEE
We present a readily portable, memory-efficient performance test system (PTS) for Tasers. The proposed PTS has been developped for the most widely used Conducted Energy Weapons (...
205
click to vote
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
439
click to vote
COCOON
2011
Springer
14 years 6 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
171
click to vote
CSCW
2012
ACM
14 years 2 months ago
2012
ACM
We have friends we consider very close and acquaintances we barely know. The social sciences use the term tie strength to denote this differential closeness with the people in our...