Sciweavers

2107 search results - page 147 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
124
Voted
IJCGA
2002
69views more  IJCGA 2002»
15 years 3 months ago
On Deletion in Delaunay Triangulations
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
Olivier Devillers
163
Voted
SSD
2005
Springer
188views Database» more  SSD 2005»
15 years 9 months ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
143
Voted
BMCBI
2004
150views more  BMCBI 2004»
15 years 3 months ago
SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters
Background: Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a u...
Chunlin Wang, Elliot J. Lefkowitz
116
Voted
COLING
2002
15 years 3 months ago
A Quantitative Model of Word Order and Movement in English, Dutch and German Complement Constructions
We present a quantitative model of word order and movement constraints that enables a simple and uniform treatment of a seemingly heterogeneous collection of linear order phenomena...
Karin Harbusch, Gerard Kempen
INFOCOM
2008
IEEE
15 years 10 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu