Sciweavers

642 search results - page 112 / 129
» Approximation Algorithms for Minimum K-Cut
Sort
View
IIS
2003
13 years 10 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
QUESTA
2010
112views more  QUESTA 2010»
13 years 7 months ago
Admission control for a multi-server queue with abandonment
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
Yasar Levent Koçaga, Amy R. Ward
ICC
2007
IEEE
145views Communications» more  ICC 2007»
14 years 3 months ago
Adaptive Radial Basis Function Detector for Beamforming
— We consider nonlinear detection in rank-deficient multiple-antenna assisted beamforming systems. By exploiting the inherent symmetry of the underlying optimal Bayesian detecti...
Sheng Chen, Khaled Labib, Rong Kang, Lajos Hanzo
MOBIHOC
2005
ACM
14 years 8 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 9 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...