Sciweavers

791 search results - page 69 / 159
» Approximating the Maximum Sharing Problem
Sort
View
DAM
2008
135views more  DAM 2008»
13 years 7 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 7 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
IPPS
2005
IEEE
14 years 1 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
13 years 11 months ago
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
Khaled M. Elbassioni, René Sitters, Yan Zha...
ICASSP
2008
IEEE
14 years 2 months ago
Multi-source DOA estimation in a reverberant room
In a reverberant scenario, phase transformed weighted algorithms are more robust than Maximum Likelihood (ML) because of the insufficiency of the data model to incorporate reverb...
Andreas M. Ali, Ralph E. Hudson, Kung Yao