Sciweavers

6274 search results - page 73 / 1255
» From query complexity to computational complexity
Sort
View
ICCS
2007
Springer
14 years 4 months ago
Reducing the Representation Complexity of Lattice-Based Taxonomies
Abstract. Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of...
Sergei O. Kuznetsov, Sergei A. Obiedkov, Camille R...
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 3 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
ICDT
2009
ACM
149views Database» more  ICDT 2009»
14 years 10 months ago
Query languages for data exchange: beyond unions of conjunctive queries
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
Juan Reutter, Marcelo Arenas, Pablo Barceló
TOG
2002
208views more  TOG 2002»
13 years 9 months ago
Video matting of complex scenes
This paper describes a new framework for video matting, the process of pulling a high-quality alpha matte and foreground from a video sequence. The framework builds upon technique...
Yung-Yu Chuang, Aseem Agarwala, Brian Curless, Dav...
ICS
2009
Tsinghua U.
14 years 4 months ago
Adagio: making DVS practical for complex HPC applications
Power and energy are first-order design constraints in high performance computing. Current research using dynamic voltage scaling (DVS) relies on trading increased execution time...
Barry Rountree, David K. Lowenthal, Bronis R. de S...