Sciweavers

1629 search results - page 263 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
DAWAK
2005
Springer
15 years 3 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
CIC
2003
140views Communications» more  CIC 2003»
14 years 11 months ago
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-su...
CN
2006
145views more  CN 2006»
14 years 10 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
ACIIDS
2010
IEEE
170views Database» more  ACIIDS 2010»
14 years 8 months ago
On the Effectiveness of Gene Selection for Microarray Classification Methods
Microarray data usually contains a high level of noisy gene data, the noisy gene data include incorrect, noise and irrelevant genes. Before Microarray data classification takes pla...
Zhongwei Zhang, Jiuyong Li, Hong Hu, Hong Zhou
GIS
2008
ACM
15 years 11 months ago
The multi-rule partial sequenced route query
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number...
Haiquan Chen, Wei-Shinn Ku, Min-Te Sun, Roger Zimm...