Sciweavers

2889 search results - page 541 / 578
» An empirical study of
Sort
View
RTAS
2010
IEEE
13 years 8 months ago
Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
Karthik Lakshmanan, Ragunathan Rajkumar
WWW
2011
ACM
13 years 5 months ago
Mark my words!: linguistic style accommodation in social media
The psycholinguistic theory of communication accommodation accounts for the general observation that participants in conversations tend to converge to one another’s communicativ...
Cristian Danescu-Niculescu-Mizil, Michael Gamon, S...
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 11 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
PODS
2012
ACM
240views Database» more  PODS 2012»
12 years 17 days ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 5 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran