Sciweavers

169 search results - page 18 / 34
» The Tree of Hubs Location Problem
Sort
View
ICCTA
2007
IEEE
15 years 8 months ago
Semantic Analysis of 'to'
‘To’ is one of the most common lexemes in English (as found in 34% of the sentences in the Penn Tree Bank corpus). This paper describes the analysis of the sentences involving...
Ashish Francis Almeida, Rajat Kumar Mohanty, Pushp...
115
Voted
AUSAI
2006
Springer
15 years 5 months ago
DynamicWEB: Profile Correlation Using COBWEB
Establishing relationships within a dataset is one of the core objectives of data mining. In this paper a method of correlating behaviour profiles in a continuous dataset is presen...
Joel Scanlan, Jacky Hartnett, Raymond Williams
117
Voted
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 5 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
115
Voted
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 11 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
127
Voted
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
16 years 2 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...