3894 search results - page 709 / 779 » Approximation Algorithms for Biclustering Problems |
241
click to vote
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
122
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
We address the problem of estimating controller delay from high-level specifications during behavioral synthesis. Typically, the critical path of a synthesised behavioral design g...
112
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
135
Voted
EWSN
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. We address the problem of designing practical, energy-efficient protocols for data collection in wireless sensor networks using predictive modeling. Prior work has sugges...
125
Voted
WWW
2010
ACM
15 years 10 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...