Sciweavers

3993 search results - page 707 / 799
» Matchmaking for Structured Objects
Sort
View
ICDE
2011
IEEE
225views Database» more  ICDE 2011»
14 years 6 months ago
Methods for boosting recommender systems
—Online shopping has grown rapidly over the past few years. Besides the convenience of shopping directly from ones home, an important advantage of e-commerce is the great variety...
Rubi Boim, Tova Milo
INFOCOM
2011
IEEE
14 years 6 months ago
VIRO: A scalable, robust and namespace independent virtual Id routing for future networks
—In this paper we propose VIRO — a novel, virtual identifier (Id) routing paradigm for future networks. The objective is three-fold. First, VIRO directly addresses the challen...
Sourabh Jain, Yingying Chen, Zhi-Li Zhang
COMPGEOM
2011
ACM
14 years 6 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 6 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
NI
2011
168views more  NI 2011»
14 years 5 months ago
Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors
We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local...
Engin Türetken, Germán González...