3708 search results - page 677 / 742 » Approximating Betweenness Centrality |
TOCHI
2010
13 years 8 months ago
2010
Current Web search tools do a good job of retrieving documents that satisfy the wide range of intentions that people associate with a query – but do not do a very good job of di...
EGH
2010
Springer
13 years 8 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
ANCS
2009
ACM
13 years 7 months ago
2009
ACM
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
EMNLP
2009
13 years 7 months ago
2009
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
ICCAD
2009
IEEE
13 years 7 months ago
2009
IEEE
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...