Sciweavers

2850 search results - page 477 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 7 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 2 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
COMPGEOM
2003
ACM
15 years 7 months ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...
WWW
2002
ACM
16 years 2 months ago
Searching with numbers
A large fraction of the useful web comprises of specification documents that largely consist of hattribute name, numeric valuei pairs embedded in text. Examples include product in...
Rakesh Agrawal, Ramakrishnan Srikant
FOCS
2008
IEEE
15 years 8 months ago
Noise Tolerance of Expanders and Sublinear Expander Reconstruction
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
Satyen Kale, Yuval Peres, C. Seshadhri