Sciweavers

4526 search results - page 291 / 906
» Algorithmic problems related to the Internet
Sort
View
WEBI
2009
Springer
16 years 1 months ago
Full-Subtopic Retrieval with Keyphrase-Based Search Results Clustering
We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we pres...
Andrea Bernardini, Claudio Carpineto, Massimiliano...
ECML
2007
Springer
16 years 25 days ago
Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...
Daan Fierens, Jan Ramon, Maurice Bruynooghe, Hendr...
ISLPED
1996
ACM
72views Hardware» more  ISLPED 1996»
15 years 10 months ago
Simultaneous buffer and wire sizing for performance and power optimization
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
Jason Cong, Cheng-Kok Koh, Kwok-Shing Leung
ICPP
1995
IEEE
15 years 10 months ago
Sorting and Selection on Distributed Memory Bus Computers
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
Sanguthevar Rajasekaran, Sartaj Sahni
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 6 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani