Sciweavers

6388 search results - page 1194 / 1278
» Knowledge and Information
Sort
View
COCOON
1998
Springer
15 years 8 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
AEI
2000
63views more  AEI 2000»
15 years 4 months ago
Application of a support system to the design of wastewater treatment plants
This paper presents a case study that explores the advantages that can be derived from the use of a design support system during the design of wastewater treatment plants (WWTP). ...
Ignasi Rodríguez-Roda, Manel Poch, Ren&eacu...
CIDR
2011
401views Algorithms» more  CIDR 2011»
14 years 8 months ago
DBease: Making Databases User-Friendly and Easily Accessible
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...
MOBIHOC
2007
ACM
16 years 4 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
ICCCN
2008
IEEE
15 years 11 months ago
Localized Bridging Centrality for Distributed Network Analysis
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
Soumendra Nanda, David Kotz
« Prev « First page 1194 / 1278 Last » Next »