Sciweavers

489 search results - page 34 / 98
» Approximation Algorithms for the Minimum-Length Corridor and...
Sort
View
NIPS
2001
13 years 10 months ago
The Unified Propagation and Scaling Algorithm
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...
Yee Whye Teh, Max Welling
FOCS
2006
IEEE
14 years 3 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 10 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
ANNPR
2008
Springer
13 years 11 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi
RC
2000
99views more  RC 2000»
13 years 8 months ago
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
Timothy J. Hickey, Zhe Qju, Maarten H. van Emden