Sciweavers

569 search results - page 71 / 114
» Using Constraints for Exploring Catalogs
Sort
View
ACL
1998
13 years 9 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers
ICML
2010
IEEE
13 years 8 months ago
Non-Local Contrastive Objectives
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...
David Vickrey, Cliff Chiung-Yu Lin, Daphne Koller
CCS
2010
ACM
13 years 7 months ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
EOR
2006
81views more  EOR 2006»
13 years 7 months ago
Optimal and near-optimal policies for lost sales inventory models with at most one replenishment order outstanding
In this paper we use policy-iteration to explore the behaviour of optimal control policies for lost sales inventory models with the constraint that not more than one replenishment...
Roger M. Hill, Søren Glud Johansen
TWC
2008
85views more  TWC 2008»
13 years 7 months ago
Bandwidth partitioning in decentralized wireless networks
This paper addresses the following question, which is of interest in the design of a multiuser decentralized network. Given a total system bandwidth of W Hz and a fixed data rate c...
Nihar Jindal, Jeffrey G. Andrews, Steven Weber