316 search results - page 63 / 64 » On Approximate Majority and Probabilistic Time |
KDD
2010
ACM
13 years 11 months ago
2010
ACM
This paper intends to provide some insights of a scientific problem: how likely one’s interests can be inferred from his/her social connections – friends, friends’ friends,...
WSC
2004
13 years 8 months ago
2004
This paper describes an algorithm for approximating missing data in air traffic routes thereby allowing the lengths of different routes to be compared for our simulation analyses....
CCR
2000
13 years 7 months ago
2000
TCP congestion control 9] is designed for network stability, robustness and opportunistic use of network bu er and bandwidth resources on an end-to-end per-connection basis. Upon ...
Publication
Efficient capturing of the entire topological and geometric information of a 3D scene is an important feature in many graphics applications for rendering multi-fragment effects. Ex...
BIOINFORMATICS
2011
12 years 11 months ago
2011
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...