5100 search results - page 770 / 1020 » The Linear Complexity of a Graph |
133
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
160
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Collaborative Filtering, considered by many researchers as the most important technique for information filtering, has been extensively studied by both academic and industrial co...
150
click to vote
ICC
2007
IEEE
16 years 26 days ago
2007
IEEE
— We target M-ary data sequence estimation over time-variant frequency selective fading channels subject to cochannel interference (CCI). A novel joint reduced state sequence est...
212
click to vote
ICS
2007
Tsinghua U.
16 years 20 days ago
2007
Tsinghua U.
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
158
click to vote
SI3D
2006
ACM
16 years 14 days ago
2006
ACM
We propose a real-time method for rendering rigid objects with complex view-dependent effects under distant all-frequency lighting. Existing precomputed light transport approaches...