Sciweavers

3360 search results - page 167 / 672
» Opportunistic Data Structures with Applications
Sort
View
129
Voted
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
15 years 10 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
ECCV
2010
Springer
15 years 6 months ago
Optimum Subspace Learning and Error Correction for Tensors
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
DEBS
2007
ACM
15 years 5 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
118
Voted
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 4 months ago
An Analysis of Transaction and Joint-patent Application Networks
Many firms these days, forced by increasing international competition and an unstable economy, are opting to specialize rather than generalize as a way of maintaining their compet...
Hiroyasu Inoue
CVPR
2000
IEEE
16 years 6 months ago
Discriminant-EM Algorithm with Application to Image Retrieval
In Proc. of IEEE Conf. on CVPR'2000, Vol.I, pp.222-227, Hilton Head Island, SC, 2000 In many vision applications, the practice of supervised learning faces several difficulti...
Ying Wu, Qi Tian, Thomas S. Huang