3341 search results - page 513 / 669 » On Bounded Queries and Approximation |
208
click to vote
ICDM
2006
IEEE
15 years 12 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...
211
click to vote
SMI
2006
IEEE
15 years 12 months ago
2006
IEEE
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
163
click to vote
SSDBM
2006
IEEE
15 years 12 months ago
2006
IEEE
Monitoring movement of high-dimensional points is essential for environmental databases, geospatial applications, and biodiversity informatics as it reveals crucial information ab...
160
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
174
click to vote
AMR
2005
Springer
15 years 11 months ago
2005
Springer
The XML language is a W3C standard sustained by both the industry and the scientific community. Therefore, the available information annotated in XML keeps and will keep increasing...