Sciweavers

3146 search results - page 73 / 630
» Efficient Consequence Finding
Sort
View
NSDI
2004
13 years 11 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
BMCBI
2007
161views more  BMCBI 2007»
13 years 10 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo
CCE
2004
13 years 10 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
BIOCOMP
2006
13 years 11 months ago
Parameterized Computation of LCS for Two Sequences
- The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying t...
Yuan Lin, Jeff Jenness, Xiuzhen Huang
ICMCS
1999
IEEE
234views Multimedia» more  ICMCS 1999»
14 years 2 months ago
Spatiotemporal Segmentation and Tracking of Objects for Visualization of Videoconference Image Sequences
Abstract--In this paper, a procedure is described for the segmentation, content-based coding, and visualization of videoconference image sequences. First, image sequence analysis i...
Ioannis Kompatsiaris, Michael G. Strintzis