Sciweavers

2004 search results - page 327 / 401
» Sampling from large graphs
Sort
View
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SIGCOMM
2009
ACM
14 years 4 months ago
Hot today, gone tomorrow: on the migration of MySpace users
While some empirical studies on Online Social Networks (OSNs) have examined the growth of these systems, little is known about the patterns of decline in user population or user a...
Mojtaba Torkjazi, Reza Rejaie, Walter Willinger
ICDCS
2002
IEEE
14 years 2 months ago
A Practical Approach for ?Zero? Downtime in an Operational Information System
An Operational Information System (OIS) supports a real-time view of an organization’s information critical to its logistical business operations. A central component of an OIS ...
Ada Gavrilovska, Karsten Schwan, Van Oleson
MSR
2010
ACM
13 years 12 months ago
Identifying security bug reports via text mining: An industrial case study
-- A bug-tracking system such as Bugzilla contains bug reports (BRs) collected from various sources such as development teams, testing teams, and end users. When bug reporters subm...
Michael Gegick, Pete Rotella, Tao Xie
EUROGRAPHICS
2010
Eurographics
13 years 11 months ago
Consensus Skeleton for Non-rigid Space-time Registration
We introduce the notion of consensus skeletons for non-rigid space-time registration of a deforming shape. Instead of basing the registration on point features, which are local an...
Qian Zheng, Andrei Sharf, Andrea Tagliasacchi, Bao...