Sciweavers

3894 search results - page 449 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
SECON
2010
IEEE
15 years 2 months ago
Placement and Orientation of Rotating Directional Sensors
In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a "directional" coverage reg...
Giordano Fusco, Himanshu Gupta
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 2 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
15 years 2 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
15 years 6 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi