415 search results - page 6 / 83 » Optimally Reconstructing Weighted Graphs Using Queries |
FMSD
2007
13 years 7 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
In recent years wavelets were shown to be effective data synopses. We are concerned with the problem of finding efficiently wavelet synopses for massive data sets, in situations...
PAMI
2007
13 years 7 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
JMM2
2006
13 years 7 months ago
2006
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landm...
DASFAA
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract. In this paper, we explore the feature of sharing partial results of multiple queries to reduce the total number of messages incurred. Those queries sharing their partial ...