1445 search results - page 158 / 289 » Uniformly Hard Languages |
203
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
143
click to vote
MOBIHOC
2002
ACM
16 years 3 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
148
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
134
click to vote
ISPD
2010
ACM
15 years 11 months ago
2010
ACM
In the nanometer IC design, dummy fill is often performed to improve layout pattern uniformity and the post-CMP quality. However, filling dummies might greatly increase intercon...
162
click to vote
CCS
2009
ACM
15 years 11 months ago
2009
ACM
Network information distribution is a fundamental service for any anonymization network. Even though anonymization and information distribution about the network are two orthogona...