1382 search results - page 69 / 277 » Formal Analysis of Online Algorithms |
135
Voted
ALT
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
196
click to vote
SIGECOM
2010
ACM
15 years 10 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
184
click to vote
ICFCA
2009
Springer
16 years 20 days ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
171
click to vote
ICCAD
2002
IEEE
16 years 2 months ago
2002
IEEE
In this paper we present an advanced functional extraction tool for automatic generation of high-level RTL from switch-level circuit netlist representation. The tool is called FEV...
171
click to vote
FAC
2008
15 years 6 months ago
2008
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...