1038 search results - page 150 / 208 » Space-Bounded Query Approximation |
222
click to vote
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
111
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
162
Voted
ICDM
2006
IEEE
15 years 8 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...
152
Voted
SMI
2006
IEEE
15 years 8 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 ...
128
click to vote
SSDBM
2006
IEEE
15 years 8 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...