Sciweavers

2239 search results - page 435 / 448
» Computing with abstract matrix structures
Sort
View
ICALP
2009
Springer
16 years 3 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
127
Voted
PEPM
2010
ACM
16 years 5 days ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
HRI
2010
ACM
15 years 10 months ago
Validating interaction patterns in HRI
— In recent work, “interaction patterns” have been proposed as a means to characterize essential features of humanrobot interaction. A problem arises, however, in knowing whe...
Peter H. Kahn Jr., Brian T. Gill, Aimee L. Reicher...
ICMT
2009
Springer
15 years 10 months ago
A Simple Game-Theoretic Approach to Checkonly QVT Relations
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...
Perdita Stevens
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
15 years 9 months ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci