Sciweavers

8695 search results - page 1500 / 1739
» Making the Complex Simple
Sort
View
SIGMOD
2010
ACM
210views Database» more  SIGMOD 2010»
15 years 3 months ago
Searching trajectories by locations: an efficiency study
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...
159
Voted
AI
2008
Springer
15 years 3 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 3 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
BMCBI
2010
134views more  BMCBI 2010»
15 years 3 months ago
ScreenMill: A freely available software suite for growth measurement, analysis and visualization of high-throughput screen data
Background: Many high-throughput genomic experiments, such as Synthetic Genetic Array and yeast two-hybrid, use colony growth on solid media as a screen metric. These experiments ...
John C. Dittmar, Robert J. D. Reid, Rodney Rothste...
BMCBI
2008
91views more  BMCBI 2008»
15 years 3 months ago
t2prhd: a tool to study the patterns of repeat evolution
Background: The models developed to characterize the evolution of multigene families (such as the birth-and-death and the concerted models) have also been applied on the level of ...
Botond Sipos, Kálmán Somogyi, Istv&a...
« Prev « First page 1500 / 1739 Last » Next »