Sciweavers

255 search results - page 10 / 51
» Approximate Tree Embedding Problem - An Algebraic Approach
Sort
View
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
14 years 2 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
SIAMSC
2011
110views more  SIAMSC 2011»
13 years 2 months ago
A Finite Element Method for Second Order Nonvariational Elliptic Problems
We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements...
Omar Lakkis, Tristan Pryer
FOCS
2005
IEEE
14 years 1 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ICCV
2005
IEEE
14 years 1 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
AAAI
1990
13 years 8 months ago
Tree Decomposition with Applications to Constraint Processing
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
Itay Meiri, Judea Pearl, Rina Dechter