Sciweavers

536 search results - page 11 / 108
» Efficient Search Using Bitboard Models
Sort
View
CIKM
2010
Springer
13 years 5 months ago
EntityEngine: answering entity-relationship queries using shallow semantics
We introduce EntityEngine, a system for answering entityrelationship queries over text. Such queries combine SQLlike structures with IR-style keyword constraints and therefore, ca...
Xiaonan Li, Chengkai Li, Cong Yu
BMCBI
2011
13 years 2 months ago
Simulated evolution applied to study the genetic code optimality using a model of codon reassignments
Background: As the canonical code is not universal, different theories about its origin and organization have appeared. The optimization or level of adaptation of the canonical ge...
Jose Santos, Ángel Monteagudo
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
13 years 7 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
TSP
2010
13 years 2 months ago
Efficient Maximum Entropy Reconstruction of Nuclear Magnetic Resonance T1-T2 Spectra
Abstract--This paper deals with the reconstruction of T1-T2 correlation spectra in nuclear magnetic resonance relaxometry. The ill-posed character and the large size of this invers...
Emilie Chouzenoux, Saïd Moussaoui, Jér...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg