5169 search results - page 876 / 1034 » Locality approximation using time |
192
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
220
click to vote
TACAS
2007
Springer
16 years 29 days ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
220
click to vote
WADS
2007
Springer
16 years 29 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
195
click to vote
VEE
2005
ACM
16 years 12 days ago
2005
ACM
Virtual machines (VMs) are commonly used to distribute programs in an architecture-neutral format, which can easily be interpreted or compiled. A long-running question in the desi...
164
click to vote
SPAA
2004
ACM
16 years 8 days ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...