Sciweavers

2877 search results - page 513 / 576
» The Complexity of Planarity Testing
Sort
View
RECOMB
2005
Springer
14 years 10 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 10 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
SIGMOD
2009
ACM
138views Database» more  SIGMOD 2009»
14 years 10 months ago
PRIMA: archiving and querying historical data with evolving schemas
Schema evolution poses serious challenges in historical data management. Traditionally historical data have been archived either by (i) migrating them into the current schema vers...
Hyun J. Moon, Carlo Curino, MyungWon Ham, Carlo Za...
PODS
2002
ACM
167views Database» more  PODS 2002»
14 years 10 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
ECCV
2008
Springer
14 years 8 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee