Sciweavers

Share
3951 search results - page 2 / 791
» Automatic amortized analysis
Sort
View
COCO
2001
Springer
135views Algorithms» more  COCO 2001»
11 years 9 months ago
Simple Analysis of Graph Tests for Linearity and PCP
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
Johan Håstad, Avi Wigderson

Lecture Notes
673views
13 years 3 months ago
Combinatorial Algorithms
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
Jeff Erickson
WADS
2009
Springer
257views Algorithms» more  WADS 2009»
11 years 12 months ago
Rank-Balanced Trees
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
ICCV
2005
IEEE
12 years 7 months ago
On-Line Density-Based Appearance Modeling for Object Tracking
Object tracking is a challenging problems in real-time computer vision due to variations of lighting condition, pose, scale, and view-point over time. However, it is exceptionally...
Bohyung Han, Larry S. Davis
DAGSTUHL
2007
11 years 6 months ago
Exact Elimination of Cycles in Graphs
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
Daniel Raible, Henning Fernau
books