Sciweavers

16404 search results - page 732 / 3281
» A set coverage problem
Sort
View
INFOCOM
2008
IEEE
16 years 1 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
168
Voted
SAC
2005
ACM
16 years 28 days ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
SARA
2005
Springer
16 years 26 days ago
Feature-Discovering Approximate Value Iteration Methods
Sets of features in Markov decision processes can play a critical role ximately representing value and in abstracting the state space. Selection of features is crucial to the succe...
Jia-Hong Wu, Robert Givan
AC
2003
Springer
16 years 18 days ago
Unbounded Petri Net Synthesis
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
Philippe Darondeau
AAAI
2008
15 years 9 months ago
A Hybrid Approach to Domino Portrait Generation
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first
Hadrien Cambazard, John Horan, Eoin O'Mahony, Barr...