225 search results - page 45 / 45 » From polynomial time queries to graph structure theory |
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
130
click to vote
IPSN
2007
Springer
15 years 5 months ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
104
click to vote
CIKM
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
VLDB
2004
ACM
15 years 4 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
110
click to vote
WWW
2004
ACM
16 years 1 days ago
2004
ACM
Web link analysis has proven to be a significant enhancement for quality based web search. Most existing links can be classified into two categories: intra-type links (e.g., web h...