Sciweavers

26518 search results - page 5297 / 5304
» On achieving the
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 10 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
KDD
2007
ACM
149views Data Mining» more  KDD 2007»
14 years 10 months ago
Distributed classification in peer-to-peer networks
This work studies the problem of distributed classification in peer-to-peer (P2P) networks. While there has been a significant amount of work in distributed classification, most o...
Ping Luo, Hui Xiong, Kevin Lü, Zhongzhi Shi
SIGMOD
2007
ACM
224views Database» more  SIGMOD 2007»
14 years 10 months ago
Design of flash-based DBMS: an in-page logging approach
The popularity of high-density flash memory as data storage media has increased steadily for a wide spectrum of computing devices such as PDA's, MP3 players, mobile phones an...
Sang-Won Lee, Bongki Moon
SOSP
2003
ACM
14 years 6 months ago
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
Peer-to-peer (P2P) file sharing accounts for an astonishing volume of current Internet traffic. This paper probes deeply into modern P2P file sharing systems and the forces that...
P. Krishna Gummadi, Richard J. Dunn, Stefan Saroiu...
STACS
2010
Springer
14 years 4 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
« Prev « First page 5297 / 5304 Last » Next »