Sciweavers

2487 search results - page 339 / 498
» Partitions of Graphs into Trees
Sort
View
ICIP
2002
IEEE
14 years 10 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
ICIP
1999
IEEE
14 years 10 months ago
Spiht for Generalized Multiple Description Coding
W e present a simple and eficient scheme for using the Set Partitioning in Hierarchical Trees (SPIHT) image compression algorithm [l]in a generalized multiple description framewor...
Agnieszka C. Miguel, Alexander E. Mohr, Eve A. Ris...
ICML
2005
IEEE
14 years 9 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
WWW
2006
ACM
14 years 9 months ago
FLUX: fuzzy content and structure matching of XML range queries
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
Hua-Gang Li, S. Alireza Aghili, Divyakant Agrawal,...
WWW
2003
ACM
14 years 9 months ago
XCQ: XML Compression and Querying System
We present our development of an XML compression and querying tool, which is called XML Compression and Querying System (XCQ). This system is developed based on a novel technique ...
Wai Yeung Lam, Wilfred Ng, Peter T. Wood, Mark Lev...