Sciweavers

291 search results - page 10 / 59
» How Well Can Primal-Dual and Local-Ratio Algorithms Perform
Sort
View
VLDB
2001
ACM
157views Database» more  VLDB 2001»
16 years 1 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
TEC
2010
203views more  TEC 2010»
14 years 8 months ago
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...
Xiaodong Li
BMCBI
2007
148views more  BMCBI 2007»
15 years 1 months ago
WeederH: an algorithm for finding conserved regulatory motifs and regions in homologous sequences
Background: This work addresses the problem of detecting conserved transcription factor binding sites and in general regulatory regions through the analysis of sequences from homo...
Giulio Pavesi, Federico Zambelli, Graziano Pesole
ECCV
2004
Springer
16 years 3 months ago
Probabilistic Multi-view Correspondence in a Distributed Setting with No Central Server
Abstract. We present a probabilistic algorithm for finding correspondences across multiple images. The algorithm runs in a distributed setting, where each camera is attached to a s...
Shai Avidan, Yael Moses, Yoram Moses
MANSCI
2008
96views more  MANSCI 2008»
15 years 1 months ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...