10608 search results - page 1997 / 2122 » Complexity of O'Hara's Algorithm |
131
click to vote
ISPA
2005
Springer
15 years 8 months ago
2005
Springer
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...
155
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Knowledge of transcription factor-DNA binding patterns is crucial for understanding gene transcription. Numerous DNA-binding proteins are annotated as transcription fa...
259
click to vote
GIS
2004
ACM
16 years 4 months ago
2004
ACM
Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interacti...
144
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
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...
129
click to vote
SMA
2008
ACM
15 years 3 months ago
2008
ACM
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...