Sciweavers

274 search results - page 55 / 55
» Computational complexity of queries based on itemsets
Sort
View
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 5 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
CORR
2008
Springer
170views Education» more  CORR 2008»
13 years 5 months ago
To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
Sudhir Kumar Singh, Vwani P. Roychowdhury
NAR
2011
197views Computer Vision» more  NAR 2011»
12 years 8 months ago
AmoebaDB and MicrosporidiaDB: functional genomic resources for Amoebozoa and Microsporidia species
AmoebaDB (http://AmoebaDB.org) and MicrosporidiaDB (http://MicrosporidiaDB.org) are new functional genomic databases serving the amoebozoa and microsporidia research communities, ...
Cristina Aurrecoechea, Ana Barreto, John Brestelli...
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
13 years 12 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...