1382 search results - page 123 / 277 » Formal Analysis of Online Algorithms |
144
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
189
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
177
click to vote
SOFSEM
2007
Springer
16 years 14 days ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
182
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...
157
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...