Sciweavers

217 search results - page 18 / 44
» Deterministic Algorithm for the t-Threshold Set Problem
Sort
View
CCCG
2006
13 years 9 months ago
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Prosenjit Bose, Jason Morrison
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
14 years 2 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
DCOSS
2011
Springer
12 years 7 months ago
Distributed local broadcasting algorithms in the physical interference model
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Franci...
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
14 years 1 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
FOCS
2002
IEEE
14 years 19 days ago
Learning a Hidden Matching
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...