2569 search results - page 141 / 514 » Approximate Objects and Approximate Theories |
176
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
186
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
207
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
199
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
147
click to vote
TIT
2008
15 years 6 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...