2635 search results - page 373 / 527 » Algorithms for the Database Layout Problem |
167
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
148
click to vote
CIKM
2009
Springer
16 years 26 days ago
2009
Springer
Many users need to refer to content in existing files (pictures, tables, emails, web pages and etc.) when they write documents(programs, presentations, proposals and etc.), and o...
195
click to vote
SSDBM
2008
IEEE
16 years 20 days ago
2008
IEEE
Abstract. In recent years, there is an increasing need to monitor k nearest neighbor (k-NN) in a road network. There are existing solutions on either monitoring k-NN objects from a...
205
Voted
DASFAA
2007
IEEE
16 years 19 days ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
130
click to vote
FCCM
2007
IEEE
16 years 19 days ago
2007
IEEE
BLASTP is the most popular tool to perform comparative sequence analysis of protein sequences. An exponential increase in the size of protein sequence databases in recent years, h...