4112 search results - page 714 / 823 » Efficient Algorithms for the Spoonerism Problem |
160
click to vote
JSAC
2008
15 years 4 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
141
click to vote
JMLR
2002
15 years 4 months ago
2002
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that d...
139
click to vote
JETC
2008
15 years 2 months ago
2008
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...
132
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
147
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...