Sciweavers

1147 search results - page 148 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
WWW
2010
ACM
14 years 4 months ago
Scalable discovery of contradictions on the web
Our study addresses the problem of large-scale contradiction detection and management, from data extracted from the Web. We describe the first systematic solution to the problem,...
Mikalai Tsytsarau, Themis Palpanas, Kerstin Deneck...
SAS
2009
Springer
214views Formal Methods» more  SAS 2009»
14 years 9 months ago
Abstract Interpretation of FIFO Replacement
Interpretation of FIFO Replacement Daniel Grund and Jan Reineke Saarland University, Saarbr?ucken, Germany In hard real-time systems, the execution time of programs must be bounded...
Daniel Grund, Jan Reineke
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 9 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 16 days ago
Online Learning: Stochastic and Constrained Adversaries
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 9 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais