5595 search results - page 1034 / 1119 » Approximation Algorithms for Clustering Problems |
269
click to vote
ICDE
2007
IEEE
16 years 6 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...
225
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
117
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
Placement migration is the movement of cells within an existing placement to address a variety of post-placement design closure issues, such as timing, routing congestion, signal ...
136
click to vote
DAC
2006
ACM
16 years 5 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...
152
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Given a classification problem, our goal is to find a low-dimensional linear transformation of the feature vectors which retains information needed to predict the class labels. We...