4886 search results - page 107 / 978 » Approximate Data Exchange |
135
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
174
Voted
CIKM
2000
Springer
15 years 9 months ago
2000
Springer
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
136
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
119
Voted
IEEECIT
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we propose a new scheduling method for asynchronous circuits in bundled-data implementation. The method is based on integer linear programming (ILP) which explores ...
142
click to vote
HOTOS
2007
IEEE
15 years 8 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...