Sciweavers

144 search results - page 25 / 29
» Improved Approximation Guarantees for Sublinear-Time Fourier...
Sort
View
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
14 years 10 days ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
PAMI
2006
168views more  PAMI 2006»
13 years 7 months ago
Graphical Models and Point Pattern Matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Tibério S. Caetano, Terry Caelli, Dale Schu...
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 7 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
PODS
1999
ACM
121views Database» more  PODS 1999»
13 years 11 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
ALMOB
2008
92views more  ALMOB 2008»
13 years 7 months ago
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You