Sciweavers

10608 search results - page 1997 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ISPA
2005
Springer
14 years 3 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
BMCBI
2010
167views more  BMCBI 2010»
13 years 10 months ago
Creating PWMs of transcription factors using 3D structure-based computation of protein-DNA free binding energies
Background: Knowledge of transcription factor-DNA binding patterns is crucial for understanding gene transcription. Numerous DNA-binding proteins are annotated as transcription fa...
Denitsa Alamanova, Philip Stegmaier, Alexander E. ...
GIS
2004
ACM
14 years 11 months ago
A serverless 3D world
Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interacti...
Egemen Tanin, Aaron Harwood, Hanan Samet, Sarana N...
CP
2006
Springer
14 years 1 days ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
SMA
2008
ACM
172views Solid Modeling» more  SMA 2008»
13 years 10 months ago
Guarding curvilinear art galleries with edge or mobile guards
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
Menelaos I. Karavelas
« Prev « First page 1997 / 2122 Last » Next »