139 search results - page 24 / 28 » Sparse Projections over Graph |
JDA
2006
13 years 7 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
DASFAA
2007
IEEE
14 years 1 months ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
ICSE
1995
IEEE-ACM
13 years 11 months ago
1995
IEEE-ACM
This paper presents a compact Petri net representation that is e cient to construct for concurrent programs that use explicit tasking and rendezvous style communication. These Pet...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
IJCINI
2007
13 years 7 months ago
2007
The Cognitive Processes of Abstraction and Formal Inferences J. A. Anderson: A Brain-Like Computer for Cognitive Software Applications: the Resatz Brain Project L. Flax: Cognitive ...