Sciweavers

1399 search results - page 196 / 280
» New Algorithms for k-Center and Extensions
Sort
View
MANSCI
2007
90views more  MANSCI 2007»
13 years 8 months ago
Selecting a Selection Procedure
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
Jürgen Branke, Stephen E. Chick, Christian Sc...
CONCURRENCY
2002
99views more  CONCURRENCY 2002»
13 years 8 months ago
A distributed computing environment for interdisciplinary applications
Practical applications are generally interdisciplinary in nature. The technology is well matured for addressing individual discipline applications and not for interdisciplinary ap...
Jerry A. Clarke, Raju R. Namburu
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 9 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
DASFAA
2006
IEEE
136views Database» more  DASFAA 2006»
14 years 2 months ago
Reuse or Never Reuse the Deleted Labels in XML Query Processing Based on Labeling Schemes
To facilitate the XML query processing, several kinds of labeling schemes have been proposed. Based on the labeling schemes, the ancestordescendant and parent-child relationships i...
Changqing Li, Tok Wang Ling, Min Hu