Sciweavers

3885 search results - page 458 / 777
» Clarifying Goal Models
Sort
View
GAMESEC
2010
139views Game Theory» more  GAMESEC 2010»
15 years 4 months ago
Design of Network Topology in an Adversarial Environment
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
Assane Gueye, Jean C. Walrand, Venkat Anantharam
WINE
2010
Springer
168views Economy» more  WINE 2010»
15 years 4 months ago
On the Competitive Ratio of Online Sampling Auctions
We study online profit-maximizing auctions for digital goods with adversarial bid selection and uniformly random arrivals. Our goal is to design auctions that are constant competit...
Elias Koutsoupias, George Pierrakos
ACL
2009
15 years 4 months ago
A Syntax-Free Approach to Japanese Sentence Compression
Conventional sentence compression methods employ a syntactic parser to compress a sentence without changing its meaning. However, the reference compressions made by humans do not ...
Tsutomu Hirao, Jun Suzuki, Hideki Isozaki
IFIP12
2009
15 years 4 months ago
Learning Rules from User Behaviour
Pervasive computing requires infrastructures that adapt to changes in user behaviour while minimising user interactions. Policy-based approaches have been proposed as a means of pr...
Domenico Corapi, Oliver Ray, Alessandra Russo, Aro...
CORR
2010
Springer
117views Education» more  CORR 2010»
15 years 4 months ago
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
Amit Chakrabarti, Oded Regev