Sciweavers

1382 search results - page 135 / 277
» Formal Analysis of Online Algorithms
Sort
View
RTSS
1994
IEEE
15 years 10 months ago
Efficient Aperiodic Service Under Earliest Deadline Scheduling
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
Marco Spuri, Giorgio C. Buttazzo
ACL
2011
14 years 10 months ago
Semi-supervised latent variable models for sentence-level sentiment analysis
We derive two variants of a semi-supervised model for fine-grained sentiment analysis. Both models leverage abundant natural supervision in the form of review ratings, as well as...
Oscar Täckström, Ryan T. McDonald
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
14 years 1 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
16 years 1 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...
DATE
2005
IEEE
164views Hardware» more  DATE 2005»
16 years 16 hour ago
Automated Synthesis of Assertion Monitors using Visual Specifications
Automated synthesis of monitors from high-level properties plays a significant role in assertion-based verification. We present here a methodology to synthesize assertion monitors...
Ambar A. Gadkari, S. Ramesh