Sciweavers

2095 search results - page 367 / 419
» Improved pebbling bounds
Sort
View
IPL
2010
114views more  IPL 2010»
13 years 8 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
JMLR
2010
123views more  JMLR 2010»
13 years 8 months ago
Maximum Relative Margin and Data-Dependent Regularization
Leading classification methods such as support vector machines (SVMs) and their counterparts achieve strong generalization performance by maximizing the margin of separation betw...
Pannagadatta K. Shivaswamy, Tony Jebara
JPDC
2010
106views more  JPDC 2010»
13 years 8 months ago
Feedback-directed page placement for ccNUMA via hardware-generated memory traces
Non-uniform memory architectures with cache coherence (ccNUMA) are becoming increasingly common, not just for large-scale high performance platforms but also in the context of mul...
Jaydeep Marathe, Vivek Thakkar, Frank Mueller
MST
2010
110views more  MST 2010»
13 years 8 months ago
Facets of the Fully Mixed Nash Equilibrium Conjecture
In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE Conjecture, in selfish routing for the s...
Rainer Feldmann, Marios Mavronicolas, Andreas Pier...
SIAMDM
2010
128views more  SIAMDM 2010»
13 years 8 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...