Sciweavers

2713 search results - page 389 / 543
» Parameterized Tree Systems
Sort
View
ICIP
2003
IEEE
16 years 8 months ago
Redundant representation with complex wavelets: how to achieve sparsity
Overcomplete transforms, like the Dual-Tree Complex Wavelet Transform, offer more flexible signal representations than critically-sampled transforms, due to their properties of sh...
Nick G. Kingsbury, Tanya Reeves
ICIP
2002
IEEE
16 years 8 months ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
ICDE
2007
IEEE
163views Database» more  ICDE 2007»
16 years 7 months ago
Adding Context to Preferences
To handle the overwhelming amount of information currently available, personalization systems allow users to specify the information that interests them through preferences. Most ...
Kostas Stefanidis, Evaggelia Pitoura, Panos Vassil...
ICDE
2004
IEEE
100views Database» more  ICDE 2004»
16 years 7 months ago
Simple, Robust and Highly Concurrent B-trees with Node Deletion
Why might B-tree concurrency control still be interesting? For two reasons: (i) currently exploited "real world" approaches are complicated; (ii) simpler proposals are n...
David B. Lomet
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
16 years 7 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...