Sciweavers

2340 search results - page 34 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
COMPGEOM
2010
ACM
15 years 4 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
15 years 6 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska
CLUSTER
2004
IEEE
15 years 3 months ago
An efficient end-host architecture for cluster communication
Cluster computing environments built from commodity hardware have provided a cost-effective solution for many scientific and high-performance applications. Likewise, middleware te...
Xin Qi, Gabriel Parmer, Richard West
CIAC
2006
Springer
135views Algorithms» more  CIAC 2006»
15 years 3 months ago
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Dror Rawitz, Shimon Shahar
COMCOM
2006
96views more  COMCOM 2006»
14 years 12 months ago
Dynamic cache reconfiguration strategies for cluster-based streaming proxy
The high bandwidth and the relatively long-lived characteristics of digital video are key limiting factors in the wide-spread usage of streaming content over the Internet. The pro...
Yang Guo, Zihui Ge, Bhuvan Urgaonkar, Prashant J. ...