Sciweavers

145 search results - page 28 / 29
» The Maximum Distinguishing Number of a Group
Sort
View
DGCI
2009
Springer
13 years 10 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
ITSL
2008
13 years 8 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
DEBU
2010
126views more  DEBU 2010»
13 years 7 months ago
GeoSIM: A Geospatial Data Collection System for Participatory Urban Texture Documentation
Participatory texture documentation (PTD) is a geospatial data collection process in which a group of users (dedicated individuals and/or general public) with camera-equipped mobi...
Farnoush Banaei Kashani, Houtan Shirani-Mehr, Bei ...
PARA
2000
Springer
13 years 11 months ago
JavaGrande - High Performance Computing with Java
The JavaGrande Forum is a group of users, researchers, and interested parties from industry. The Forum members are either trying to use Java for resource-intensive applications or ...
Michael Philippsen, Ronald F. Boisvert, Vladimir G...
WSDM
2010
ACM
236views Data Mining» more  WSDM 2010»
14 years 4 months ago
Personalized Click Prediction in Sponsored Search
Sponsored search is a multi-billion dollar business that generates most of the revenue for search engines. Predicting the probability that users click on ads is crucial to sponsor...
Erick Cantú-Paz, Haibin Cheng