5169 search results - page 449 / 1034 » Locality approximation using time |
208
click to vote
SIGIR
1998
ACM
15 years 12 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
234
click to vote
EWC
2010
15 years 5 months ago
2010
Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, findin...
194
click to vote
BROADNETS
2007
IEEE
16 years 2 months ago
2007
IEEE
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...
208
click to vote
VISUALIZATION
1997
IEEE
15 years 12 months ago
1997
IEEE
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
232
Voted
KAIS
2011
15 years 2 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...