Sciweavers

3374 search results - page 305 / 675
» Explaining Similarity of Terms
Sort
View
RECOMB
2004
Springer
16 years 7 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
CADE
2008
Springer
16 years 7 months ago
MaLARea SG1- Machine Learner for Automated Reasoning with Semantic Guidance
This paper describes a system combining model-based and learning-based methods for automated reasoning in large theories, i.e. on a large number of problems that use many axioms, l...
Geoff Sutcliffe, Jirí Vyskocil, Josef Urban...
STOC
2007
ACM
108views Algorithms» more  STOC 2007»
16 years 7 months ago
Combinatorial complexity in O-minimal geometry
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
Saugata Basu
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
16 years 7 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...
SIGMOD
2009
ACM
121views Database» more  SIGMOD 2009»
16 years 7 months ago
Query-aware shrinking test databases
Keeping the test databases as small as possible leads to faster execution of tests and facilitates the task of completing the test cases and evaluating the actual outputs against ...
Claudio de la Riva, Javier Tuya, María Jos&...