Sciweavers

2517 search results - page 270 / 504
» Specifying Weak Sets
Sort
View
JMLR
2006
150views more  JMLR 2006»
15 years 6 months ago
Building Support Vector Machines with Reduced Classifier Complexity
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
S. Sathiya Keerthi, Olivier Chapelle, Dennis DeCos...
NETWORKS
2008
15 years 6 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
ML
2006
ACM
131views Machine Learning» more  ML 2006»
15 years 6 months ago
Markov logic networks
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge b...
Matthew Richardson, Pedro Domingos
SOCO
2008
Springer
15 years 6 months ago
Compositional Modeling for Data-Centric Business Applications
Data-centric business applications comprise an important class of distributed systems that includes on-line stores, document management systems, and patient portals. However, their...
Ethan K. Jackson, Wolfram Schulte
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
15 years 6 months ago
Expressive Declassification Policies and Modular Static Enforcement
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
Anindya Banerjee, David A. Naumann, Stan Rosenberg