Sciweavers

5210 search results - page 667 / 1042
» Exact geometric computation
Sort
View
DCC
2006
IEEE
16 years 4 months ago
Optimal Index Assignment for Multiple Description Lattice Vector Quantization
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
Xiang Huang, Xiaolin Wu
CVPR
2010
IEEE
16 years 17 days ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 11 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
ICPPW
2009
IEEE
15 years 11 months ago
CkDirect: Unsynchronized One-Sided Communication in a Message-Driven Paradigm
A significant fraction of parallel scientific codes are iterative with barriers between iterations or even between phases of the same iteration. The sender of a message is assur...
Eric J. Bohm, Sayantan Chakravorty, Pritish Jetley...
CSR
2009
Springer
15 years 11 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...