Sciweavers

690 search results - page 123 / 138
» Dense Admissible Sets
Sort
View
SBBD
2008
256views Database» more  SBBD 2008»
13 years 8 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
IJRR
2008
109views more  IJRR 2008»
13 years 7 months ago
Robotic Grasping of Novel Objects using Vision
We consider the problem of grasping novel objects, specifically ones that are being seen for the first time through vision. Grasping a previously unknown object, one for which a 3...
Ashutosh Saxena, Justin Driemeyer, Andrew Y. Ng
JCB
2008
94views more  JCB 2008»
13 years 7 months ago
Prioritize and Select SNPs for Association Studies with Multi-Stage Designs
Large-scale whole genome association studies are increasingly common, due in large part to recent advances in genotyping technology. With this change in paradigm for genetic studi...
Jing Li
KAIS
2008
114views more  KAIS 2008»
13 years 7 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
PAMI
2008
216views more  PAMI 2008»
13 years 7 months ago
Annotating Images by Mining Image Search Results
Although it has been studied for years by the computer vision and machine learning communities, image annotation is still far from practical. In this paper, we propose a novel atte...
Xin-Jing Wang, Lei Zhang 0001, Xirong Li, Wei-Ying...