Sciweavers

187 search results - page 22 / 38
» On the uniform edge-partition of a tree
Sort
View
IEEEMM
2002
466views more  IEEEMM 2002»
14 years 11 months ago
Measuring Web Application Quality with WebQEM
measuring the product's "lower abstraction attributes."5 We see attributes as measurable properties of an entity--here, a Web application--and propose using a qualit...
Luis Olsina, Gustavo Rossi
TKDE
2010
218views more  TKDE 2010»
14 years 6 months ago
LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
Yuzhe Tang, Shuigeng Zhou, Jianliang Xu
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 12 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
DCC
2004
IEEE
15 years 11 months ago
Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
Qian Zhao, Hanying Feng, Michelle Effros
SMI
2006
IEEE
111views Image Analysis» more  SMI 2006»
15 years 5 months ago
A Fast Particle System Framework for Interactive Implicit Modeling
In this paper, we present a controllable, fast and efficient particle system framework for skeletal implicit surfaces defined by the BlobTree model. We propose efficient algori...
Eric Galin, Rémi Allègre, Samir Akko...