4850 search results - page 770 / 970 » Approximate Data Structures with Applications |
117
click to vote
MONET
2007
15 years 4 months ago
2007
— Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a scheme is present...
110
click to vote
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
In this paper, we introduce a novel Flip INvariant Descriptor (FIND). FIND improves the degenerated performance resulted from image flips and reduces both space and time costs. F...
138
click to vote
IPL
2010
15 years 3 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
140
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
159
click to vote
OTM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Rapidly changing business requirements necessitate the adhoc composition of expert teams to handle complex business cases. Expertcentric properties such as skills, howeve...