Sciweavers

4488 search results - page 333 / 898
» Properties of NP-Complete Sets
Sort
View
CGF
2011
14 years 10 months ago
Prior Knowledge for Part Correspondence
Classical approaches to shape correspondence base their computation purely on the properties, in particular geometric similarity, of the shapes in question. Their performance stil...
Oliver van Kaick, Andrea Tagliasacchi, Oana Sidi, ...
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 10 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
FOSSACS
2011
Springer
14 years 10 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
PVLDB
2011
14 years 9 months ago
CoHadoop: Flexible Data Placement and Its Exploitation in Hadoop
Hadoop has become an attractive platform for large-scale data analytics. In this paper, we identify a major performance bottleneck of Hadoop: its lack of ability to colocate relat...
Mohamed Y. Eltabakh, Yuanyuan Tian, Fatma Özc...
HIPEAC
2011
Springer
14 years 6 months ago
Decoupled zero-compressed memory
For each computer system generation, there are always applications or workloads for which the main memory size is the major limitation. On the other hand, in many cases, one could...
Julien Dusser, André Seznec