Sciweavers

1092 search results - page 199 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
CVPR
2008
IEEE
16 years 3 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
107
Voted
CIKM
2009
Springer
15 years 8 months ago
Semi-nonnegative matrix factorization with global statistical consistency for collaborative filtering
Collaborative Filtering, considered by many researchers as the most important technique for information filtering, has been extensively studied by both academic and industrial co...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
VISUALIZATION
2005
IEEE
15 years 7 months ago
Query-Driven Visualization of Large Data Sets
We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is cons...
Kurt Stockinger, John Shalf, Kesheng Wu, E. Wes Be...
MOBIHOC
2009
ACM
15 years 8 months ago
Revenue generation for truthful spectrum auction in dynamic spectrum access
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...
Juncheng Jia, Qian Zhang, Qin Zhang, Mingyan Liu
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
15 years 8 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...