2826 search results - page 422 / 566 » Maximal Vector Computation in Large Data Sets |
250
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Relational DBMS typically execute concurrent queries independently by invoking a set of operator instances for each query. To exploit common data retrievals and computation in con...
169
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
138
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The problem of identifying the minimal gene set required to sustain life is of crucial importance in understanding cellular mechanisms and designing therapeutic drugs. This work d...
160
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
210
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
In many image and video collections, we have access
only to partially labeled data. For example, personal photo
collections often contain several faces per image and a caption
t...