Sciweavers

367 search results - page 39 / 74
» Truncated incremental search
Sort
View
CCCG
2001
13 years 9 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
ACL
1996
13 years 9 months ago
Head Automata and Bilingual Tiling: Translation with Minimal Representations
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
Hiyan Alshawi
TODAES
2008
160views more  TODAES 2008»
13 years 7 months ago
A new efficient retiming algorithm derived by formal manipulation
A new efficient algorithm is derived for the minimal period retiming by formal manipulation. Contrary to all previous algorithms, which used binary search on a range of candidate ...
Hai Zhou
BMCBI
2010
101views more  BMCBI 2010»
13 years 7 months ago
Hidden Markov model speed heuristic and iterative HMM search procedure
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...
L. Steven Johnson, Sean R. Eddy, Elon Portugaly
GIS
2008
ACM
14 years 8 months ago
Monitoring continuous queries over streaming locations
We report on our experience from design and implementation of a powerful map application for managing, querying and visualizing evolving locations of moving objects. Instead of bu...
Kostas Patroumpas, Evi Kefallinou, Timos K. Sellis