11211 search results - page 473 / 2243 » Rank-Sensitive Data Structures |
185
click to vote
SENSYS
2006
ACM
16 years 24 days ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
174
click to vote
ICCS
2004
Springer
16 years 7 days ago
2004
Springer
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner thr...
205
click to vote
KES
2004
Springer
16 years 6 days ago
2004
Springer
We consider the problem of inferring kinetic mechanisms for biochemical reactions from time series data. Using a priori knowledge about the structure of chemical reaction kinetics ...
163
click to vote
DCC
1999
IEEE
15 years 11 months ago
1999
IEEE
We report on the performance evaluation of greedy parsing with a single step lookahead, denoted as flexible parsing. We also introduce a new fingerprint based data structure which...
179
click to vote
COMPSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-mat...