Sciweavers

605 search results - page 32 / 121
» Parameterized Dynamic Tables
Sort
View
BIOCOMP
2007
15 years 2 days ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
MASCOTS
2007
15 years 1 days ago
A Turnover based Adaptive HELLO Protocol for Mobile Ad Hoc and Sensor Networks
—We present a turnover based adaptive HELLO protocol (TAP), which enables nodes in mobile networks to dynamically adjust their HELLO messages frequency depending on the current s...
François Ingelrest, Nathalie Mitton, David ...
PSB
2003
14 years 12 months ago
MAP: Searching Large Genome Databases
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
Tamer Kahveci, Ambuj K. Singh
ICASSP
2011
IEEE
14 years 2 months ago
Exploiting sparseness of backing-off language models for efficient look-ahead in LVCSR
In this paper, we propose a new method for computing and applying language model look-ahead in a dynamic network decoder, exploiting the sparseness of backing-off n-gram language ...
David Nolden, Hermann Ney, Ralf Schlüter
VC
2008
99views more  VC 2008»
14 years 10 months ago
Minimizing probable collision pairs searched in interactive animation authoring
Animation authoring involves an author's interaction with a scene, resulting in varying scene complexity for a given animation sequence. In such a varying environment, detecti...
Parag Agarwal, Srinivas Rajagopalan, B. Prabhakara...