Sciweavers

5647 search results - page 1129 / 1130
» A word from the editor
Sort
View
SIGMOD
1997
ACM
136views Database» more  SIGMOD 1997»
13 years 11 months ago
STRUDEL: A Web-site Management System
The Strudel system applies concepts from database management systems to the process of building Web sites. Strudel’s key idea is separating the management of the site’s data, t...
Mary F. Fernández, Daniela Florescu, Jaewoo...
COMGEO
2011
ACM
13 years 2 months ago
Improved bounds for cops-and-robber pursuit
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Laurent Alonso, Edward M. Reingold
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 2 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
BMCBI
2007
107views more  BMCBI 2007»
13 years 7 months ago
OReFiL: an online resource finder for life sciences
Background: Many online resources for the life sciences have been developed and introduced in peer-reviewed papers recently, ranging from databases and web applications to data-an...
Yasunori Yamamoto, Toshihisa Takagi
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
« Prev « First page 1129 / 1130 Last » Next »