Sciweavers

1236 search results - page 170 / 248
» fast 2010
Sort
View
ISPASS
2010
IEEE
15 years 8 months ago
PEBIL: Efficient static binary instrumentation for Linux
Binary instrumentation facilitates the insertion of additional code into an executable in order to observe or modify the executable's behavior. There are two main approaches t...
Michael Laurenzano, Mustafa M. Tikir, Laura Carrin...
PAKDD
2010
ACM
175views Data Mining» more  PAKDD 2010»
15 years 8 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...
SIGGRAPH
2010
ACM
15 years 8 months ago
Volume contact constraints at arbitrary resolution
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
Jérémie Allard, François Faure, Hadrien Courtec...
ICDCS
2010
IEEE
15 years 8 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
ICDCS
2010
IEEE
15 years 8 months ago
A New Buffer Cache Design Exploiting Both Temporal and Content Localities
: This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O requests. Popular data blocks are selected as refe...
Jin Ren, Qing Yang