Sciweavers

2907 search results - page 200 / 582
» Presentations of Structures in Admissible Sets
Sort
View
WWW
2007
ACM
16 years 7 months ago
On building graphs of documents with artificial ants
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
Hanane Azzag, Julien Lavergne, Christiane Guinot, ...
PADL
2009
Springer
16 years 7 months ago
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...
Ketil Malde, Bryan O'Sullivan
SIGMOD
2006
ACM
202views Database» more  SIGMOD 2006»
16 years 6 months ago
Avatar semantic search: a database approach to information retrieval
We present Avatar Semantic Search, a prototype search engine that exploits annotations in the context of classical keyword search. The process of annotations is accomplished offli...
Eser Kandogan, Rajasekar Krishnamurthy, Sriram Rag...
PERCOM
2009
ACM
16 years 1 months ago
Using Situation Lattices in Sensor Analysis
Highly sensorised systems present two parallel challenges: how to design a sensor suite that can efficiently and cost-effectively support the needs of given services; and to extr...
Juan Ye, Lorcan Coyle, Simon Dobson, Paddy Nixon
IV
2009
IEEE
191views Visualization» more  IV 2009»
16 years 1 months ago
An Heuristic for the Construction of Intersection Graphs
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
Paolo Simonetto, David Auber