Sciweavers

2969 search results - page 375 / 594
» A space efficient algorithm for group structure computation
Sort
View
159
Voted
CIC
2003
140views Communications» more  CIC 2003»
15 years 6 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...
ISPAN
1999
IEEE
15 years 9 months ago
Distributed Clustering for Ad Hoc Networks
A Distributed Clustering Algorithm DCA and a Distributed Mobility-Adaptive Clustering DMAC algorithm are presented that partition the nodes of a fully mobile network ad hoc networ...
Stefano Basagni
CVPR
2009
IEEE
17 years 3 days ago
Granularity-tunable Gradients Partition (GGP) Descriptors for Human Detection
This paper proposes a novel descriptor, granularitytunable gradients partition (GGP), for human detection. The concept granularity is used to define the spatial and angular unce...
Yazhou Liu (Harbin Institute of Technology), Shigu...
192
Voted
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
15 years 11 months ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
16 years 5 months ago
Approximately detecting duplicates for streaming data using stable bloom filters
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
Fan Deng, Davood Rafiei