Sciweavers

14 search results - page 3 / 3
» Quantum Query Complexity of Multilinear Identity Testing
Sort
View
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 5 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
13 years 11 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
OTM
2007
Springer
13 years 11 months ago
Translating XPath Queries into SPARQL Queries
Abstract The W3C has developed XPath [3] as a query language for XML data. XPath is embedded in many other languages like XQuery and XSLT. The name of XPath derives from its basic ...
Matthias Droop, Markus Flarer, Jinghua Groppe, Sve...
BIOCOMP
2009
13 years 6 months ago
Improving Remote Homology Detection Using Sequence Properties and Position Specific Scoring Matrices
Current biological sequence comparison tools frequently fail to recognize matches between homologs when sequence similarity is below the twilight zone of less than 25% sequence id...
Gina Cooper, Michael L. Raymer