Sciweavers

736 search results - page 49 / 148
» A dynamic data structure for approximate range searching
Sort
View
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 8 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
BMCBI
2008
123views more  BMCBI 2008»
13 years 9 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
ESOA
2006
14 years 14 days ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
WCNC
2010
IEEE
14 years 21 days ago
Dynamic Control of Data Ferries under Partial Observations
—Controlled mobile helper nodes called data ferries have recently been proposed to bridge communications between disconnected nodes in a delay-tolerant manner. While existing wor...
Chi Harold Liu, Ting He, Kang-won Lee, Kin K. Leun...
ICDCN
2009
Springer
14 years 1 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon