Sciweavers

3946 search results - page 299 / 790
» The computational complexity of choice sets
Sort
View
CGA
2010
15 years 3 months ago
Using Visualization to Debug Visualization Software
Developing visualization applications is non-trivial and poses special challenges. This is due to the fact that typical visualization software processes a large amount of data res...
Robert S. Laramee
TOG
2012
255views Communications» more  TOG 2012»
13 years 9 months ago
A probabilistic model for component-based shape synthesis
We present an approach to synthesizing shapes from complex domains, by identifying new plausible combinations of components from existing shapes. Our primary contribution is a new...
Evangelos Kalogerakis, Siddhartha Chaudhuri, Daphn...
ICIP
2002
IEEE
16 years 8 months ago
Boosting face recognition on a large-scale database
Performance of many state-of-the-art face recognition (FR) methods deteriorates rapidly, when large in size databases are considered. In this paper, we propose a novel clustering ...
Juwei Lu, Konstantinos N. Plataniotis
JAPLL
2010
179views more  JAPLL 2010»
15 years 5 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
ENTCS
2010
118views more  ENTCS 2010»
15 years 4 months ago
Fragments-based Model Reduction: Some Case Studies
Molecular biological models usually suffer from a dramatic combinatorial blow up. Indeed, proteins form complexes and can modify each others, which leads to the formation of a hug...
Jérôme Feret