Sciweavers

11231 search results - page 1676 / 2247
» Digging for Data Structures
Sort
View
PAKDD
2010
ACM
175views Data Mining» more  PAKDD 2010»
15 years 11 months ago
EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs
Abstract. We report a surprising, persistent pattern in large sparse social graphs, which we term EigenSpokes. We focus on large Mobile Call graphs, spanning about 186K nodes and m...
B. Aditya Prakash, Ashwin Sridharan, Mukund Seshad...
CIKM
2009
Springer
15 years 11 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
DUX
2007
15 years 11 months ago
180 x 120: designing alternate location systems
Using 180 RFID tags to track and plot locations over time, guests to an event at the San Francisco Museum of Modern Art (SFMOMA) collectively constructed a public visualization of...
Eric Paulos, Anthony Burke, Tom Jenkins, Karen Mar...
CGI
2009
IEEE
15 years 11 months ago
Easy integral surfaces: a fast, quad-based stream and path surface algorithm
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...
Tony McLoughlin, Robert S. Laramee, Eugene Zhang
VRML
2010
ACM
15 years 11 months ago
SpiderGL: a JavaScript 3D graphics library for next-generation WWW
Thanks to the WebGL graphics API specification for the JavaScript programming language, the possibility of using the GPU capabilities in a web browser without the need for an ad-...
Marco Di Benedetto, Federico Ponchio, Fabio Ganove...
« Prev « First page 1676 / 2247 Last » Next »