Sciweavers

3708 search results - page 119 / 742
» Approximating Betweenness Centrality
Sort
View
ESA
2004
Springer
119views Algorithms» more  ESA 2004»
15 years 6 months ago
A Straight Skeleton Approximating the Medial Axis
We propose the linear axis, a new skeleton for polygonal shapes. It is related to the medial axis and the straight skeleton, being the result of a wavefront propagation process. Th...
Mirela Tanase, Remco C. Veltkamp
95
Voted
ICCSA
2004
Springer
15 years 6 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
87
Voted
DASFAA
2003
IEEE
115views Database» more  DASFAA 2003»
15 years 6 months ago
The BofS Solution to Limitations of Approximate Summaries
Data warehouses are of crucial importance to decision-making in competitive organizations. The fact that they store enormous quantities of data is a challenge in what concerns per...
Pedro Furtado, João Pedro Costa
110
Voted
JAIR
2006
160views more  JAIR 2006»
15 years 20 days ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
129
Voted
TSP
2010
14 years 7 months ago
Double sparsity: learning sparse dictionaries for sparse signal approximation
Abstract--An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of ...
Ron Rubinstein, Michael Zibulevsky, Michael Elad