Sciweavers

2009 search results - page 131 / 402
» Dense Interest Points
Sort
View
ICDCSW
2006
IEEE
14 years 2 months ago
Reducing Latency in Rendezvous-Based Publish-Subscribe Systems for Wireless Ad Hoc Networks
To ensure decoupling between publishers and subscribers, most publish-subscribe systems route notifications through intermediate message brokers. A byproduct of this practice is ...
Nuno Carvalho, Filipe Araújo, Luís R...
DAGM
2004
Springer
14 years 1 months ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf
COMPGEOM
2003
ACM
14 years 1 months ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...
ESA
2003
Springer
141views Algorithms» more  ESA 2003»
14 years 1 months ago
Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
Nicola Wolpert
AAAI
2010
13 years 9 months ago
Conformal Mapping by Computationally Efficient Methods
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
Stefan Pintilie, Ali Ghodsi