1170 search results - page 27 / 234 » How Fast Is Too Fast |
145
click to vote
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
117
click to vote
CG
2008
Springer
15 years 28 days ago
2008
Springer
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration st...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
How to reduce the handoff delay and how to make appropriate handoff decisions are two fundamental challenges in designing an effective handoff scheme for 802.11 networks to provide...
107
click to vote
ISM
2008
IEEE
15 years 7 months ago
2008
IEEE
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...
101
Voted
VLDB
2001
ACM
15 years 5 months ago
2001
ACM
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...