Sciweavers

1136 search results - page 207 / 228
» Finding Small Holes
Sort
View
DAC
2010
ACM
13 years 9 months ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...
COMAD
2009
13 years 9 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 9 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
MOBICOM
2010
ACM
13 years 8 months ago
Pushing the envelope of indoor wireless spatial reuse using directional access points and clients
Recent work demonstrates that directional antennas have significant potential to improve wireless network capacity in indoor environments. This paper provides a broader exploratio...
Xi Liu, Anmol Sheth, Michael Kaminsky, Konstantina...
MOBICOM
2010
ACM
13 years 8 months ago
Profiling users in a 3g network using hourglass co-clustering
With widespread popularity of smart phones, more and more users are accessing the Internet on the go. Understanding mobile user browsing behavior is of great significance for seve...
Ram Keralapura, Antonio Nucci, Zhi-Li Zhang, Lixin...