Sciweavers

2370 search results - page 27 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
WSDM
2010
ACM
245views Data Mining» more  WSDM 2010»
14 years 7 months ago
Improving Quality of Training Data for Learning to Rank Using Click-Through Data
In information retrieval, relevance of documents with respect to queries is usually judged by humans, and used in evaluation and/or learning of ranking functions. Previous work ha...
Jingfang Xu, Chuanliang Chen, Gu Xu, Hang Li, Elbi...
PIMRC
2008
IEEE
14 years 4 months ago
Maximum likelihood based methods for OFDM intercarrier spacing characterization
— One of the main task to be done by a cognitive receiver is to sense its spectral environment in order to distinguish surrounding systems from each others. Actually most systems...
Abdelaziz Bouzegzi, Philippe Ciblat, Pierre Jallon
CONEXT
2006
ACM
14 years 3 months ago
Detail characterization of paths in pocket switched networks
Pocket Switched Networking (PSN) is a new communication paradigm between mobile devices. It takes advantage of every local communication opportunity, and the physical mobility of ...
Abderrahmen Mtibaa, Augustin Chaintreau, Christoph...
LCN
2003
IEEE
14 years 2 months ago
Characterization of the Burst Stabilization Protocol for the RR/RR CICQ Switch
Input buffered switches with Virtual Output Queueing (VOQ) can be unstable when presented with unbalanced loads. Existing scheduling algorithms, including iSLIP for Input Queued (...
Neil J. Gunther, Kenneth J. Christensen, Kenji Yos...
GD
2003
Springer
14 years 2 months ago
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner