Sciweavers

506 search results - page 96 / 102
» Proving Properties about Lists Using Containers
Sort
View
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
14 years 11 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
ICPR
2000
IEEE
15 years 10 months ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes
SDM
2009
SIAM
192views Data Mining» more  SDM 2009»
15 years 6 months ago
Mining Cohesive Patterns from Graphs with Feature Vectors.
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
Arash Rafiey, Flavia Moser, Martin Ester, Recep Co...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
15 years 4 months ago
Apply Model Checking to Security Analysis in Trust Management
Trust management is a form of access control that uses delegation to achieve scalability beyond a single organization or federation. However, delegation can be difficult to contr...
Mark Reith, Jianwei Niu, William H. Winsborough
SIGCOMM
2004
ACM
15 years 3 months ago
The feasibility of supporting large-scale live streaming applications with dynamic application end-points
While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is lit...
Kunwadee Sripanidkulchai, Aditya Ganjam, Bruce M. ...