Sciweavers

1399 search results - page 49 / 280
» New Algorithms for k-Center and Extensions
Sort
View
PDPTA
2004
15 years 6 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
GLOBECOM
2010
IEEE
15 years 2 months ago
Sensor Placement for Minimum Exposure in Distributed Active Sensing Networks
Distributed active sensing is a new sensing paradigm, where active sensors and passive sensors are distributed in a field, and collaboratively detect and track the objects. "E...
Na Xia, Khuong Vu, Rong Zheng
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 7 months ago
Robust Reputation-Based Ranking on Bipartite Rating Networks
With the growth of the Internet and E-commerce, bipartite rating networks are ubiquitous. In such bipartite rating networks, there exist two types of entities: the users and the o...
Rong-Hua Li, Jeffrey Xu Yu, Xin Huang, Hong Cheng
AWPN
2008
232views Algorithms» more  AWPN 2008»
15 years 7 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
Robin Bergenthum, Sebastian Mauser
131
Voted
ICML
2003
IEEE
16 years 6 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington