Sciweavers

537 search results - page 58 / 108
» A new upper bound for 3-SAT
Sort
View
KDD
2008
ACM
116views Data Mining» more  KDD 2008»
15 years 10 months ago
Volatile correlation computation: a checkpoint view
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
Wenjun Zhou, Hui Xiong
AFL
2011
98views more  AFL 2011»
13 years 10 months ago
Accepting Networks of Evolutionary Processors with Subregular Filters
In this paper, we propose a new variant of Accepting Networks of Evolutionary Processors, in which the operations can be applied only arbitrarily to the words, while the filters ...
Florin Manea, Bianca Truthe
JMLR
2012
13 years 12 days ago
Max-Margin Min-Entropy Models
We propose a new family of latent variable models called max-margin min-entropy (m3e) models, which define a distribution over the output and the hidden variables conditioned on ...
Kevin Miller, M. Pawan Kumar, Benjamin Packer, Dan...
SODA
2001
ACM
115views Algorithms» more  SODA 2001»
14 years 11 months ago
Loss-bounded analysis for differentiated services
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
Alexander Kesselman, Yishay Mansour
DAC
2004
ACM
15 years 11 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay